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”).

A178528
Tree generated by the Beatty sequence of sqrt(3).
5
1, 2, 3, 4, 5, 7, 6, 9, 8, 11, 12, 16, 10, 14, 15, 21, 13, 18, 19, 26, 20, 28, 27, 37, 17, 23, 24, 33, 25, 35, 36, 49, 22, 30, 31, 42, 32, 44, 45, 61, 34, 47, 48, 66, 46, 63, 64, 87, 29, 40, 39, 54, 41, 56, 57, 78, 43, 59, 60, 82, 62, 85, 84, 115
OFFSET
1,2
COMMENTS
A permutation of the positive integers.
FORMULA
Let r=sqrt(3) 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)=Floor(r*T(n-1),j));
T(n,2j+1)=Floor((s*T(n-1,j));
for j=0,1,...,2^(n-1)-1, n>=2.
EXAMPLE
First levels of the tree:
.....................1
.....................2
..............3..............4
..........5.......7......6.......9
........8..11..12..16..10..14..15..21
MATHEMATICA
a = {1, 2}; row = {a[[-1]]}; r = Sqrt[3]; s = r/(r - 1); Do[a = Join[a, row = Flatten[{Floor[#*{r, s}]} & /@ row]], {n, 5}]; a (* Ivan Neretin, Nov 09 2015 *)
CROSSREFS
Cf. A022838 (Beatty sequence of sqrt(3)), A054406, A074049.
Sequence in context: A347540 A120750 A265672 * A183084 A185975 A232639
KEYWORD
nonn,tabf
AUTHOR
Clark Kimberling, Dec 23 2010
STATUS
approved