|
Search: id:A094834
|
|
|
| A094834 |
|
Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,....,2n+1, s(0) = 3, s(2n+1) = 6. |
|
+0
1
|
|
| 1, 5, 21, 82, 308, 1131, 4096, 14705, 52497, 186733, 662630, 2347680, 8309143, 29388368, 103895601, 367187437, 1297452581, 4583924154, 16193659132, 57204089987, 202065531888, 713750040577, 2521114546457, 8905002445437
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
In general a(n)= (2/m)*Sum(r,1,m-1,Sin(r*j*Pi/m)Sin(r*k*Pi/m)(2Cos(r*Pi/m))^(2n+1)) counts (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < m and |s(i)-s(i-1)| = 1 for i = 1,2,....,2n+1, s(0) = j, s(2n+1) = k.
|
|
FORMULA
|
a(n)=(2/9)*Sum(r, 1, 8, Sin(r*Pi/3)Sin(2*r*Pi/3)(2Cos(r*Pi/9))^(2n+1)) a(n)=6a(n-1)-9a(n-2)+a(n-3) G.f.: x(-1+x)/(-1+6x-9x^2+x^3)
|
|
CROSSREFS
|
Sequence in context: A081038 A153008 A051196 this_sequence A147504 A026017 A132310
Adjacent sequences: A094831 A094832 A094833 this_sequence A094835 A094836 A094837
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Herbert Kociemba (kociemba(AT)t-online.de), Jun 13 2004
|
|
|
Search completed in 0.002 seconds
|
