

A182641


Array T(n,k)=[k*r^n][r*[kr^(n1)]], where r = golden mean = (1+sqrt(5))/2, for k>=1, for n>=2; [ ]=floor.


0



1, 1, 1, 1, 0, 0, 1, 1, 1, 2, 1, 0, 1, 1, 0, 1, 0, 2, 1, 0, 2, 1, 1, 1, 1, 0, 2, 0, 1, 0, 1, 0, 0, 2, 0, 2, 1, 1, 1, 0, 1, 2, 0, 2, 0, 1, 1, 1, 1, 1, 1, 0, 2, 0, 2, 1, 0, 0, 1, 1, 1, 0, 2, 0, 2, 0, 1, 1, 1, 1, 1, 1, 0, 2, 0, 2, 0, 2, 1, 0, 1, 0, 1, 1, 0, 2, 0, 2, 0, 2, 0, 1, 0
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,10


COMMENTS

Let F=A000045=(0,1,1,2,3,5,8,13,...) = Fibonacci numbers.
T(2n,k)=0 for 1<=k<=F(2n1), and T(2n,F(2n))=1, for n>=2.
T(2n+1,k)=2 for 1<=k<=F(2n1), T(2n+1,F(2n))=1, for n>=2.


LINKS



EXAMPLE

Northwest corner of the array:
1...1...1...1...1...1...1...
1...0...1...0...0...1...0...
0...1...1...2...1...1...1...
2...1...1...1...0...0...1...
0...0...0...0...1...1...1...
2...2...2...2...1...1...1...
0...0...0...0...0...0...0...
2...2...2...2...2...2...2...


CROSSREFS



KEYWORD



AUTHOR



STATUS

approved



