cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A305560 Expansion of Sum_{k>=0} binomial(k,floor(k/2))*x^k/Product_{j=1..k} (1 - j*x).

This page as a plain text file.
%I A305560 #11 Feb 16 2025 08:33:54
%S A305560 1,1,3,10,39,176,893,4985,30229,197452,1379655,10250087,80558195,
%T A305560 666916238,5795111845,52691973136,499969246647,4938724595994,
%U A305560 50679201983653,539209298355565,5938139329609621,67582179415195986,793755139140445707,9608367683839952732,119730171975510540577
%N A305560 Expansion of Sum_{k>=0} binomial(k,floor(k/2))*x^k/Product_{j=1..k} (1 - j*x).
%C A305560 Stirling transform of A001405.
%H A305560 Vaclav Kotesovec, <a href="/A305560/b305560.txt">Table of n, a(n) for n = 0..550</a>
%H A305560 N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>
%H A305560 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/StirlingTransform.html">Stirling Transform</a>
%F A305560 E.g.f.: BesselI(0,2*(exp(x) - 1)) + BesselI(1,2*(exp(x) - 1)).
%F A305560 a(n) = Sum_{k=0..n} Stirling2(n,k)*binomial(k,floor(k/2)).
%p A305560 a:= n-> add(binomial(j, floor(j/2))*Stirling2(n, j), j=0..n):
%p A305560 seq(a(n), n=0..30);  # _Alois P. Heinz_, Jun 21 2018
%t A305560 nmax = 24; CoefficientList[Series[Sum[Binomial[k, Floor[k/2]] x^k/Product[1 - j x, {j, 1, k}], {k, 0, nmax}], {x, 0, nmax}], x]
%t A305560 nmax = 24; CoefficientList[Series[BesselI[0, 2 (Exp[x] - 1)] + BesselI[1, 2 (Exp[x] - 1)], {x, 0, nmax}], x] Range[0, nmax]!
%t A305560 Table[Sum[StirlingS2[n, k] Binomial[k, Floor[k/2]], {k, 0, n}], {n, 0, 24}]
%Y A305560 Cf. A001405, A005773, A064856, A305406.
%K A305560 nonn
%O A305560 0,3
%A A305560 _Ilya Gutkovskiy_, Jun 21 2018