id:A094608 - OEIS Search Results

Search: id:A094608

Displaying 1-1 of 1 results found.

page 1

Rectangular array T by antidiagonals: row n consists of ranks of n in A000119.

+0
2

1, 2, 4, 3, 6, 9, 5, 7, 12, 17, 8, 10, 14, 22, 25, 13, 11, 15, 27, 30, 38, 21, 16, 19, 28, 40, 43, 59, 34, 18, 20, 33, 41, 46, 67, 64, 55, 26, 23, 35, 48, 51, 77, 72, 98, 89, 29, 24, 36, 49, 61, 85, 80, 101, 106, 144, 42, 31, 44, 56, 62, 95, 93, 132, 114, 153, 233, 47, 32, 45 (list; table; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Every positive integer occurs exactly once in T; thus a is a permutation of the positive integers. Row 1 consists of Fibonacci numbers. To obtain T from the array T' in A094607, add 1 to every number in T', then shift row 1 one place to the right, and fill the initial place with 1.`
	EXAMPLE	`A northwest corner of T:` `1 2 3 5 8` `4 6 7 10 11` `9 12 14 15 19` `17 22 27 28 33`
	CROSSREFS	`Cf. A000045, A000119, A094607.` `Adjacent sequences: A094605 A094606 A094607 this_sequence A094609 A094610 A094611` `Sequence in context: A110749 A077529 A120620 this_sequence A056537 A083221 A075652`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu), May 14 2004`

page 1

Search completed in 0.002 seconds

Last modified May 16 23:01 EDT 2008. Contains 139884 sequences.

AT&T Labs Research