|
|
A026244
|
|
a(n) = 4^n*(4^n+1)/2.
|
|
7
|
|
|
1, 10, 136, 2080, 32896, 524800, 8390656, 134225920, 2147516416, 34359869440, 549756338176, 8796095119360, 140737496743936, 2251799847239680, 36028797153181696, 576460752840294400, 9223372039002259456, 147573952598266347520, 2361183241469182345216
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
|
|
FORMULA
|
With interpolated zeros 0, 1, 0, 10, ... has a(n) = (4^n - (-4)^n + 2*2^n - 2*(-2)^n)/16 and counts walks of length n between adjacent vertices of the 4-cube.
G.f.: (1 - 10*x)/((1 - 4*x)*(1 - 16*x)). (End)
a(n) = Sum_{k = 0..n} 9*k*binomial(2n, 2k) = Sum_{k = 0..n} 9^k*A086645(n, k);
a(n) = 8^n*T(n,5/4) where T is the Chebyshev polynomial of first kind;
e.g.f.: exp(10*x)*cosh(6*x). (End)
|
|
MAPLE
|
|
|
MATHEMATICA
|
|
|
PROG
|
(Scala) ((List.fill(20)(4: BigInt)).scanLeft(1: BigInt)(_ * _)).map((n: BigInt) => n * (n + 1)/2) // Alonso del Arte, Jun 22 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|