Write n = C(i,2)+C(j,1) with i>j>=0; let L[n] = [i,j]; sequence gives list of pairs L[n], n >= 0.
1, 0, 2, 0, 2, 1, 3, 0, 3, 1, 3, 2, 4, 0, 4, 1, 4, 2, 4, 3, 5, 0, 5, 1, 5, 2, 5, 3, 5, 4, 6, 0, 6, 1
Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword
13 seqfan posts
Wed Sep 7 20:54:48 CEST 2011 [seqfan] Re: Seqfan Digest, Vol 36, Issue 1
Wed Sep 7 16:26:50 CEST 2011 [seqfan] Re: Seqfan Digest, Vol 36, Issue 1
Tue Sep 6 20:44:24 CEST 2011 [seqfan] Re: Seqfan Digest, Vol 36, Issue 1
Mon Sep 5 07:25:05 CEST 2011 [seqfan] Re: help needed with former sequence A138036
Mon Sep 5 02:47:54 CEST 2011 [seqfan] Re: help needed with former sequence A138036
Mon Sep 5 02:40:25 CEST 2011 [seqfan] Re: help needed with former sequence A138036 (N. J. A. Sloane)
Mon Sep 5 00:31:58 CEST 2011 [seqfan] Re: help needed with former sequence A138036
Sun Sep 4 23:38:59 CEST 2011 [seqfan] Re: help needed with former sequence A138036
Sun Sep 4 23:21:01 CEST 2011 [seqfan] Re: help needed with former sequence A138036
Sun Sep 4 23:21:01 CEST 2011 [seqfan] Re: help needed with former sequence A138036
Sun Sep 4 12:51:55 CEST 2011 [seqfan] Re: help needed with former sequence A138036
Sun Sep 4 12:51:55 CEST 2011 [seqfan] Re: help needed with former sequence A138036
Sun Sep 4 11:19:37 CEST 2011 [seqfan] help needed with former sequence A138036
Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword
Links to OEIS content are included according to
The OEIS End-User License Agreement
.