cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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
Offset: 1

Views

Author

Clark Kimberling, May 14 2004

Keywords

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.

Examples

			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