id:A097283 - OEIS Search Results

Search: id:A097283

Displaying 1-1 of 1 results found.

page 1

Contains exactly once every pair (i,j) satisfying 0 < i < j.

+0
3

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 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`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	`Cf. A097284, A097285.` `Sequence in context: A117920 A079617 A079616 this_sequence A118314 A002033 A074206` `Adjacent sequences: A097280 A097281 A097282 this_sequence A097284 A097285 A097286`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu), Aug 05 2004`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research