This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A182641 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. 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(2n-1), and T(2n,F(2n))=1, for n>=2. T(2n+1,k)=2 for 1<=k<=F(2n-1), T(2n+1,F(2n))=1, for n>=2. (row 2)=A078588. 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 Cf. A000045. Sequence in context: A259896 A113313 A074871 * A319020 A099200 A093578 Adjacent sequences:  A182638 A182639 A182640 * A182642 A182643 A182644 KEYWORD nonn,tabl AUTHOR Clark Kimberling, Nov 25 2010 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 24 17:58 EDT 2019. Contains 324330 sequences. (Running on oeis4.)