|
Search: id:A073028
|
|
|
| A073028 |
|
a(n)= max{ C(n,0), C(n-1,1), C(n-2,2), ..., C(n-k,k), ...}. |
|
+0
1
|
|
| 1, 1, 2, 3, 4, 6, 10, 15, 21, 35, 56, 84, 126, 210, 330, 495, 792, 1287, 2002, 3003, 5005, 8008, 12376, 19448, 31824, 50388, 77520, 125970, 203490, 319770, 497420, 817190, 1307504, 2042975, 3268760, 5311735, 8436285, 13123110, 21474180, 34597290
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
lim a(n)/a(n-1)=(1+sqrt(5))/2
|
|
REFERENCES
|
Peter Boros (borospet(AT)freemail.hu): Lectures on Fibonacci's World at the SOTERIA Foundation, 1999.
|
|
FORMULA
|
a(n) = binomial(n-A060065(n), A060065(n)). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Jun 16 2004
|
|
EXAMPLE
|
a(6)=6 because C(6,0)=1, C(5,1)=5, C(4,2)=6, C(3,3)=1, and max of them = 6.
|
|
CROSSREFS
|
Sequence in context: A097699 A086990 A090412 this_sequence A104977 A018062 A070542
Adjacent sequences: A073025 A073026 A073027 this_sequence A073029 A073030 A073031
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Miklos Kristof (kristmikl(AT)freemail.hu), Aug 22 2002
|
|
|
Search completed in 0.002 seconds
|
