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.

A335946 a(n) = 1 + Sum_{k=0..n-1} binomial(n,k)^2 * a(k).

This page as a plain text file.
%I A335946 #8 Jul 06 2020 07:41:07
%S A335946 1,2,10,110,2154,65902,2903446,174109546,13636888810,1351801926542,
%T A335946 165434393561910,24497621303302666,4317170011370444982,
%U A335946 892891315599103615082,214174328063904077240962,58974283594413521123672110,18476316023495768160707616490
%N A335946 a(n) = 1 + Sum_{k=0..n-1} binomial(n,k)^2 * a(k).
%H A335946 Seiichi Manyama, <a href="/A335946/b335946.txt">Table of n, a(n) for n = 0..248</a>
%F A335946 Sum_{n>=0} a(n) * x^n / (n!)^2 = BesselI(0,2*sqrt(x)) / (2 - BesselI(0,2*sqrt(x))).
%F A335946 a(n) = 2 * A102221(n) for n > 0.
%t A335946 a[n_] := a[n] = 1 + Sum[Binomial[n, k]^2 a[k], {k, 0, n - 1}]; Table[a[n], {n, 0, 16}]
%t A335946 nmax = 16; CoefficientList[Series[BesselI[0, 2 Sqrt[x]]/(2 - BesselI[0, 2 Sqrt[x]]), {x, 0, nmax}], x] Range[0, nmax]!^2
%Y A335946 Row sums of A102220.
%Y A335946 Cf. A000629, A102221.
%K A335946 nonn
%O A335946 0,2
%A A335946 _Ilya Gutkovskiy_, Jul 01 2020