login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A183083
Tree generated by the Beatty sequence of -1+sqrt(8).
1
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,2
COMMENTS
A permutation of the positive integers.
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.
EXAMPLE
Top five rows:
1
2
3 4
5 6 7 8
9 11 10 13 12 15 14 17
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 *)
CROSSREFS
Sequence in context: A162344 A283962 A335133 * A113220 A113218 A296424
KEYWORD
nonn,tabf
AUTHOR
Clark Kimberling, Dec 23 2010
STATUS
approved