The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A097615 Array (read by antidiagonals) where T(0,j) = 1, T(i,0) = 1, otherwise T(i,j) = floor[(1/Phi)*T(i,j-1) + (1+Phi)*T(i-1,j) - (1/Phi)*T(i-1,j-1)] where Phi = (sqrt(5)+1)/2. 0
 1, 1, 1, 1, 2, 1, 1, 5, 3, 1, 1, 13, 9, 3, 1, 1, 34, 28, 11, 3, 1, 1, 89, 86, 40, 12, 3, 1, 1, 233, 259, 140, 49, 13, 3, 1, 1, 610, 767, 473, 190, 56, 14, 3, 1, 1, 1597, 2241, 1552, 703, 233, 63, 14, 3, 1 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS The 2nd column (a(i,1) entries) is every other Fibonacci number starting w offset 1. Each row ends with a repeating number, call it b(n), these numbers can also be defined as b(0) = 1, b(n) = floor(2*Phi^2*b(n-1)) - c where c=2 if row index is odd, c=1 if row index is even. LINKS CROSSREFS Cf. A000045. Sequence in context: A055818 A106240 A340561 * A288386 A062993 A105556 Adjacent sequences: A097612 A097613 A097614 * A097616 A097617 A097618 KEYWORD nonn,tabl AUTHOR Gerald McGarvey, Aug 30 2004 STATUS approved

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

Last modified November 28 10:39 EST 2022. Contains 358411 sequences. (Running on oeis4.)