|
Search: id:A114198
|
|
|
| A114198 |
|
Sum{binomial(n,k)^2*F(k+1), k=0..n}. |
|
+0
2
|
|
| 1, 2, 7, 31, 142, 659, 3113, 14918, 72199, 351983, 1726022, 8504509, 42070429, 208812722, 1039387519, 5186451311, 25935769702, 129942777227, 652133298421, 3277734587302, 16496741964221, 83129076840317, 419362231888882
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
Paul Barry, On Integer-Sequence-Based Constructions of Generalized Pascal Triangles, Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.4.
|
|
FORMULA
|
a(n)=sum{k=0..n, C(n, k)^2*F(k+1)}; a(n)=A114197(2n, n).
|
|
CROSSREFS
|
Cf. A000045.
Sequence in context: A059846 A034698 A115605 this_sequence A055836 A076177 A007164
Adjacent sequences: A114195 A114196 A114197 this_sequence A114199 A114200 A114201
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Paul Barry (pbarry(AT)wit.ie), Nov 16 2005
|
|
|
Search completed in 0.002 seconds
|
