OFFSET
0,2
LINKS
Robert Israel, Table of n, a(n) for n = 0..1451
FORMULA
a(n) = (1/(2*n)) * Sum_{k=1..n} k * (k+1) * Pell(k+2) * binomial(2*n,n-k) for n > 0.
D-finite with recurrence: (32 + 64*n)*a(n) + (96 + 112*n)*a(n + 1) + (112 + 32*n)*a(n + 2) + (-128 - 32*n)*a(n + 3) + (-78 - 16*n)*a(n + 4) + (50 + 9*n)*a(n + 5) + (-n - 6)*a(n + 6) = 0. - Robert Israel, Feb 12 2026
MAPLE
f:= gfun:-rectoproc({(32 + 64*n)*a(n) + (96 + 112*n)*a(n + 1) + (112 + 32*n)*a(n + 2) + (-128 - 32*n)*a(n + 3) + (-78 - 16*n)*a(n + 4) + (50 + 9*n)*a(n + 5) + (-n - 6)*a(n + 6), a(0) = 1, a(1) = 5, a(2) = 28, a(3) = 155, a(4) = 845, a(5) = 4547}, a(n), remember):
map(f, [$0..30]); # Robert Israel, Feb 12 2026
PROG
(PARI) pell(n) = ([2, 1; 1, 0]^n)[2, 1];
a(n) = if(n==0, 1, sum(k=1, n, k*(k+1)*pell(k+2)*binomial(2*n, n-k))/(2*n));
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Dec 10 2025
STATUS
approved
