The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A361432 Square array T(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where T(n,k) = Sum_{j=0..floor(n/2)} k^(n-j) * binomial(n,2*j). 2
1, 1, 0, 1, 1, 0, 1, 2, 2, 0, 1, 3, 6, 4, 0, 1, 4, 12, 20, 8, 0, 1, 5, 20, 54, 68, 16, 0, 1, 6, 30, 112, 252, 232, 32, 0, 1, 7, 42, 200, 656, 1188, 792, 64, 0, 1, 8, 56, 324, 1400, 3904, 5616, 2704, 128, 0, 1, 9, 72, 490, 2628, 10000, 23360, 26568, 9232, 256, 0 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,8
LINKS
FORMULA
T(0,k) = 1, T(1,k) = k; T(n,k) = 2 * k * T(n-1,k) - (k-1) * k * T(n-2,k).
T(n,k) = ((k + sqrt(k))^n + (k - sqrt(k))^n)/2.
G.f. of column k: (1 - k * x)/(1 - 2 * k * x + (k-1) * k * x^2).
E.g.f. of column k: exp(k * x) * cosh(sqrt(k) * x).
EXAMPLE
Square array begins:
1, 1, 1, 1, 1, 1, ...
0, 1, 2, 3, 4, 5, ...
0, 2, 6, 12, 20, 30, ...
0, 4, 20, 54, 112, 200, ...
0, 8, 68, 252, 656, 1400, ...
0, 16, 232, 1188, 3904, 10000, ...
PROG
(PARI) T(n, k) = sum(j=0, n\2, k^(n-j)*binomial(n, 2*j));
(PARI) T(n, k) = round(((k+sqrt(k))^n+(k-sqrt(k))^n))/2;
CROSSREFS
Main diagonal gives A084062.
Sequence in context: A198793 A085388 A351339 * A294498 A292860 A265609
KEYWORD
nonn,tabl,easy
AUTHOR
Seiichi Manyama, Mar 11 2023
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 2 21:38 EDT 2024. Contains 373051 sequences. (Running on oeis4.)