The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A094608 Rectangular array T by antidiagonals: row n consists of ranks of n in A000119. 1
 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; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS 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. LINKS 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. Sequence in context: A077529 A143516 A120620 * A256661 A179216 A192176 Adjacent sequences:  A094605 A094606 A094607 * A094609 A094610 A094611 KEYWORD nonn,tabl AUTHOR Clark Kimberling, May 14 2004 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 17 20:06 EST 2022. Contains 350410 sequences. (Running on oeis4.)