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.

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

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

Table of n, a(n) for n=0..54.

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