OFFSET
0,2
COMMENTS
Binomial transform of A151093.
For p prime, a(p) - 2 == 0 (mod 2*p).
FORMULA
a(n) = Sum_{k=0..n} binomial(n, k)*2^(n-k)*A005566(k).
a(n) ~ 6^(n+1) / (Pi*n). - Vaclav Kotesovec, Feb 09 2026
MAPLE
a := n-> add(binomial(n, k)*binomial(n-k, iquo(n-k, 2))*binomial(2*k+1, k+1), k = 0 .. n): seq(a(n), n = 0 .. 24);
MATHEMATICA
len := 24; Table[n!, {n, 0, len}] CoefficientList[Series[(BesselI[0, 2x] + BesselI[1, 2x])^2 Exp[2x], {x, 0, len}], x] (* Peter Luschny, Mar 19 2025 *)
PROG
(Python)
from math import comb as C
def a(n):
return sum(C(n, k)*2**(n-k)*C(k, k//2)*C(k+1, (k+1)//2) for k in range(n+1))
print([a(n) for n in range(25)])
(PARI) my(x='x+O('x^30)); Vec(serlaplace((besseli(0, 2*x) + x*besseli(1, 2*x))^2*exp(2*x))) \\ Michel Marcus, Mar 11 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Mélika Tebni, Mar 09 2025
STATUS
approved
