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.

A183083 Tree generated by the Beatty sequence of -1+sqrt(8).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 10, 13, 12, 15, 14, 17, 16, 19, 20, 24, 18, 22, 23, 28, 21, 26, 27, 33, 25, 30, 31, 37, 29, 35, 34, 41, 36, 44, 43, 52, 32, 39, 40, 48, 42, 50, 51, 61, 38, 46, 47, 57, 49, 59, 60, 72, 45, 55, 54, 66, 56, 68, 67, 81, 53, 64
Offset: 1

Views

Author

Clark Kimberling, Dec 23 2010

Keywords

Comments

A permutation of the positive integers.

Examples

			Top five rows:
1
2
3 4
5 6 7 8
9 11 10 13 12 15 14 17
		

Crossrefs

Programs

  • Mathematica
    a = {1, 2}; row = {a[[-1]]}; r = Sqrt[8] - 1; s = r/(r - 1); Do[a = Join[a, row = Flatten[{Floor[#*{r, s}]} & /@ row]], {n, 5}]; a (* Ivan Neretin, Nov 09 2015 *)

Formula

Let L(n)=Floor(r*n) and U(n)=Floor(s*n), where r=-1+sqrt(8) and s=r/(r-1).
The tree-array T(n,k) is then given by rows:
T(0,0) = 1; T(1,0) = 2; T(n,2j) = L(T(n-1),j); T(n,2j+1) = U(T(n-1),j);
for j=0,1,...,2^(n-1)-1, n>=2.