|
Search: id:A081671
|
|
|
| A081671 |
|
Expansion of exp(4x)I_0(2x). |
|
+0
10
|
|
| 1, 4, 18, 88, 454, 2424, 13236, 73392, 411462, 2325976, 13233628, 75682512, 434662684, 2505229744, 14482673832, 83940771168, 487610895942, 2838118247064, 16547996212044, 96635257790352, 565107853947444
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Binomial transform of A026375. Second binomial transform of A000984.
Largest coefficient of (1+4x+x^2)^n. - Paul Barry (pbarry(AT)wit.ie), Dec 15 2003
Row sums of triangle in A124574 . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Sep 27 2007
Also number of paths from (0,0) to (n,0) using steps U=(1,1), H=(1,0) and D=(1,-1), the H steps come in 4 colors. - Nour-Eddine Fahssi (fahssin(AT)yahoo.fr), Feb 05 2008
|
|
REFERENCES
|
Tony D. Noe, On the Divisibility of Generalized Central Trinomial Coefficients, Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.7.
|
|
FORMULA
|
a(n) = sum{m=0..n, sum{k=0..m, C(n, m)C(m, k)C(2k, k)}}
G.f.: 1/sqrt((1-2*x)*(1-6*x)). - Vladeta Jovovic (vladeta(AT)eunet.rs), Oct 09 2003
a(n)=sum{k=0..n, 2^(n-k)*C(n, k)C(2k, k)} - Paul Barry (pbarry(AT)wit.ie), Jan 27 2005
|
|
CROSSREFS
|
Sequence in context: A083325 A050146 A083879 this_sequence A006629 A068764 A127394
Adjacent sequences: A081668 A081669 A081670 this_sequence A081672 A081673 A081674
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Paul Barry (pbarry(AT)wit.ie), Mar 28 2003
|
|
|
Search completed in 0.002 seconds
|
