|
%I #6 Mar 30 2012 18:57:12
%S 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,
%T 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,
%U 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
%N Array T(n,k)=[k*r^n]-[r*[kr^(n-1)]], where r = golden mean = (1+sqrt(5))/2, for k>=1, for n>=2; [ ]=floor.
%C Let F=A000045=(0,1,1,2,3,5,8,13,...) = Fibonacci numbers.
%C T(2n,k)=0 for 1<=k<=F(2n-1), and T(2n,F(2n))=1, for n>=2.
%C T(2n+1,k)=2 for 1<=k<=F(2n-1), T(2n+1,F(2n))=1, for n>=2.
%C (row 2)=A078588.
%e Northwest corner of the array:
%e 1...1...1...1...1...1...1...
%e 1...0...1...0...0...1...0...
%e 0...1...1...2...1...1...1...
%e 2...1...1...1...0...0...1...
%e 0...0...0...0...1...1...1...
%e 2...2...2...2...1...1...1...
%e 0...0...0...0...0...0...0...
%e 2...2...2...2...2...2...2...
%Y Cf. A000045.
%K nonn,tabl
%O 1,10
%A _Clark Kimberling_, Nov 25 2010
|
