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.

A340903 a(0) = 1; a(n) = Sum_{k=1..n} binomial(n,k) * sigma_0(k) * a(n-k).

This page as a plain text file.
%I A340903 #14 Mar 29 2022 15:10:57
%S A340903 1,1,4,20,139,1192,12318,148318,2041754,31616757,544005172,
%T A340903 10296204096,212589150300,4755177958104,114545293676588,
%U A340903 2956316416222300,81386676426000157,2380590235918735576,73729207700492304684,2410324868012471929670,82944575892433740648996
%N A340903 a(0) = 1; a(n) = Sum_{k=1..n} binomial(n,k) * sigma_0(k) * a(n-k).
%H A340903 Seiichi Manyama, <a href="/A340903/b340903.txt">Table of n, a(n) for n = 0..413</a>
%F A340903 E.g.f.: 1 / (1 - Sum_{i>=1} Sum_{j>=1} x^(i*j) / (i*j)!).
%F A340903 E.g.f.: 1 / (1 - Sum_{k>=1} sigma_0(k) * x^k/k!). - _Seiichi Manyama_, Mar 29 2022
%t A340903 a[0] = 1; a[n_] := a[n] = Sum[Binomial[n, k] DivisorSigma[0, k] a[n - k], {k, 1, n}]; Table[a[n], {n, 0, 20}]
%t A340903 nmax = 20; CoefficientList[Series[1/(1 - Sum[Sum[x^(i j)/(i j)!, {j, 1, nmax}], {i, 1, nmax}]), {x, 0, nmax}], x] Range[0, nmax]!
%o A340903 (PARI) my(N=40, x='x+O('x^N)); Vec(serlaplace(1/(1-sum(k=1, N, numdiv(k)*x^k/k!)))) \\ _Seiichi Manyama_, Mar 29 2022
%o A340903 (PARI) a(n) = if(n==0, 1, sum(k=1, n, numdiv(k)*binomial(n, k)*a(n-k))); \\ _Seiichi Manyama_, Mar 29 2022
%Y A340903 Cf. A000005, A000670, A129921, A295739, A340904.
%K A340903 nonn
%O A340903 0,3
%A A340903 _Ilya Gutkovskiy_, Jan 26 2021