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.

A277437 Square array read by antidiagonals upwards in which T(n,k) is the n-th number j such that, descending by the main diagonal of the pyramid described in A245092, the height difference between the level j (starting from the top) and the level of the next terrace is equal to k.

Original entry on oeis.org

1, 3, 2, 5, 4, 9, 7, 6, 12, 20, 8, 10, 21, 36, 72, 11, 13, 25, 50, 91, 144, 14, 16, 32, 56, 112
Offset: 1

Views

Author

Omar E. Pol, Dec 29 2016

Keywords

Comments

This is a permutation of the natural numbers.
Column k lists the numbers with precipice k. For more information about the precipices see A280223 and A280295.
The structure of the stepped pyramid arises after the 90-degree-zig-zag folding of the diagram of the isosceles triangle A237593.
The terraces at the m-th level of the pyramid are also the parts of the symmetric representation of sigma(m), m >= 1.
The stepped pyramid is also one of the 3D-quadrants of the stepped pyramid described in A244050.
If a number m is in the column k and k > 1 then m + 1 is the column k - 1.
The largest Dyck path of the symmetric representations of next k - 1 positive integers greater than T(n,k) shares the middle point of the largest Dyck path of the symmetric representation of sigma(T(n,k)). For more information see A237593.

Examples

			The corner of the square array begins:
   1,  2,  9, 20, 72, 144,
   3,  4, 12, 36, 91,
   5,  6, 21, 50,
   7, 10, 25,
   8, 13,
  11,
  ...
T(1,6) = 144 because it is the smallest number with precipice 6.
		

Crossrefs

Formula

T(n,1) = A071562(n+1) - 1.

Extensions

a(20)-a(26) from Omar E. Pol, Jan 02 2017