|
Search: id:A109262
|
|
|
| A109262 |
|
A Catalan transform of the Fibonacci numbers. |
|
+0
2
|
|
| 0, 1, 2, 6, 19, 63, 215, 749, 2650, 9490, 34318, 125104, 459152, 1694914, 6287896, 23429158, 87635243, 328917615, 1238303243, 4674847097, 17692789741, 67114622451, 255120892105, 971649360211, 3707176155659, 14167390221873
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
A column of A109267.
Hankel transform is -F(2n). a(n+1) has Hankel transform F(2n+1). - Paul Barry (pbarry(AT)wit.ie), Nov 22 2007
|
|
FORMULA
|
G.f.: xc(x)/(1-xc(x)-x^2c(x)^2)=(1-sqrt(1-4x))/(2(sqrt(1-4x)+x)) where c(x) is the g.f. of A000108; a(n)=sum{k=0..n, (k/(2n-k))binomial(2n-k, n-k)F(k)}.
|
|
CROSSREFS
|
Cf. A081696.
Sequence in context: A120900 A059712 A059713 this_sequence A006724 A057409 A001170
Adjacent sequences: A109259 A109260 A109261 this_sequence A109263 A109264 A109265
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Paul Barry (pbarry(AT)wit.ie), Jun 24 2005
|
|
|
Search completed in 0.002 seconds
|
