id:A097289 - OEIS Search Results

Search: id:A097289

Displaying 1-1 of 1 results found.

page 1

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

+0
2

1, 1, 2, 2, 1, 3, 3, 1, 4, 4, 2, 3, 1, 5, 5, 2, 4, 1, 6, 6, 2, 5, 3, 4, 1, 7, 7, 2, 6, 3, 5, 1, 8, 8, 2, 7, 3, 6, 4, 5, 1, 9, 9, 2, 8, 3, 7, 4, 6, 1, 10, 10, 2, 9, 3, 8, 4, 7, 5, 6, 1, 11, 11, 2, 10, 3, 9, 4, 8, 5, 7, 1, 12, 12, 2, 11, 3, 10, 4, 9, 5, 8, 6, 7, 1, 13, 13, 2, 12, 3, 11, 4, 10, 5, 9, 6, 8, 1 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`All pairs (i,j) having i>j occur (not necessarily uniquely) except those of the form (i,i-1) for i>=3. (Those are included at A097291.)`
	FORMULA	`Obtained from A097283 by inserting m right after the first occurrence of m, for each positive integer m.`
	CROSSREFS	`Cf. A097290, A097291.` `Sequence in context: A104660 A093613 A118816 this_sequence A114115 A126268 A097291` `Adjacent sequences: A097286 A097287 A097288 this_sequence A097290 A097291 A097292`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu), Aug 05 2004`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.

AT&T Labs Research