|
Search: id:A065033
|
|
|
| A065033 |
|
1 appears three times, other numbers twice. |
|
+0
7
|
|
| 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15, 15, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, 28, 28, 29, 29, 30, 30
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
Gives number of terms in n-th row of many common tables.
Number of partitions of the (n+1)-th Fibonacci number into distinct Fibonacci numbers: a(n) = A000119(A000045(n)), see also A098641. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 24 2005
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=0,...,1000
|
|
FORMULA
|
a(0)=a(1)=a(2)= 1, a(3)=2, a(n)=a(n-1)+a(n-2)-a(n-3) for n>3 . G.f. (1-x^2+x^3)/(1-x-x^2+x^3) - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Sep 28 2006
a(n)=(3/4)+(1/4)*(-1)^(n-1)+(1/2)*(n-1)+[C(2*n,n) mod 2], with n>=0 [From Paolo P. Lava (ppl(AT)spl.at), Nov 20 2008]
|
|
PROGRAM
|
(PARI) { for (n=0, 1000, if (n<3, a=1, if (n%2, a++)); write("b065033.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 03 2009]
|
|
CROSSREFS
|
Cf. A004526, A008619.
Sequence in context: A080513 A111660 A127365 this_sequence A001057 A130472 A004526
Adjacent sequences: A065030 A065031 A065032 this_sequence A065034 A065035 A065036
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Nov 04, 2001
|
|
|
Search completed in 0.002 seconds
|
