|
Search: id:A092812
|
|
|
| A092812 |
|
Number of closed walks on the 4-cube. |
|
+0 5
|
|
| 1, 4, 40, 544, 8320, 131584, 2099200, 33562624, 536903680, 8590065664, 137439477760, 2199025352704, 35184380477440, 562949986975744, 9007199388958720, 144115188612726784, 2305843011361177600
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
With interpolated zeros this has a(n)=(6*0^n + 4^n + (-4)^n + 4*2^n + 4*(-2)^n)/16 and counts closed walks of length n at a vertex of the 4-cube [Typo corrected by Alexander R. Povolotsky (pevnev(AT)juno.com), May 26 2008]
|
|
REFERENCES
|
Ghislain R. Franssens, On a Number Pyramid Related to the Binomial, Deleham, Eulerian, MacMahon and Stirling number triangles, Journal of Integer Sequences, Vol. 9 (2006), Article 06.4.1.
|
|
LINKS
|
G. R. Franssens, On a number pyramid related to the binomial, Deleham, Eulerian, MacMahon and Stirling number triangles, Journal of Integer Sequences, Vol. 9 (2006), Article 06.4.1.
|
|
FORMULA
|
G.f.: (1-16x+24x^2)/((1-4x)(1-16x)); a(n)=3*0^n/8+16^n/8+4^n/2.
E.g.f.: cosh^4(x). O.g.f.: 1/(1-4*1*x/(1-3*2*x/(1-2*3*x/(1-1*4*x)))) (continued fraction). - Peter Bala (pbala(AT)toucansurf.com), Nov 13 2006
(-1)^n*a(n)=Sum_{k, 0<=k<=n} A086872(n,k)*(-5)^(n-k). - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Aug 17 2007
|
|
CROSSREFS
|
Essentially the same as A075878. - Kang Seonghoon (lifthrasiir(AT)gmail.com), Oct 09 2008
Cf. A026244, A081294, A054879, A121822.
Cf. A075878. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 08 2008]
Sequence in context: A034385 A074637 A075878 this_sequence A128573 A052675 A141010
Adjacent sequences: A092809 A092810 A092811 this_sequence A092813 A092814 A092815
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Paul Barry (pbarry(AT)wit.ie), Mar 11 2004
|
|
|
Search completed in 0.002 seconds
|