login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A097283
Contains exactly once every pair (i,j) satisfying 0 < i < j.
4
1, 2, 1, 3, 1, 4, 2, 3, 1, 5, 2, 4, 1, 6, 2, 5, 3, 4, 1, 7, 2, 6, 3, 5, 1, 8, 2, 7, 3, 6, 4, 5, 1, 9, 2, 8, 3, 7, 4, 6, 1, 10, 2, 9, 3, 8, 4, 7, 5, 6, 1, 11, 2, 10, 3, 9, 4, 8, 5, 7, 1, 12, 2, 11, 3, 10, 4, 9, 5, 8, 6, 7, 1, 13, 2, 12, 3, 11, 4, 10, 5, 9, 6, 8, 1, 14, 2, 13, 3, 12, 4, 11, 5, 10, 6, 9, 7, 8
OFFSET
1,2
COMMENTS
All pairs (i,j) having i > j occur except those of the form (i,i-1) for i>=3. (Those are included at A097285.)
EXAMPLE
Terms are lexically ordered in pairs by sum:
1 2 (sum = 3)
1 3 (sum = 4)
1 4 2 3 (two pairs having sum = 5), etc.
CROSSREFS
Sequence in context: A336571 A334032 A366191 * A334033 A339564 A296119
KEYWORD
nonn
AUTHOR
Clark Kimberling, Aug 05 2004
STATUS
approved