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.

A330199 Expansion of e.g.f. Product_{k>=1} exp(1 - exp(x^k)).

This page as a plain text file.
%I A330199 #8 Jul 03 2021 01:37:13
%S A330199 1,-1,-2,1,1,98,-39,3225,1226,6459,12473,821830,-214739887,-201448561,
%T A330199 -8997850614,-514986723363,-1310942141971,-26465356716946,
%U A330199 -931753364233567,-1858534483400559,167210272584038942,-7112146717031426801,312288595642509829797
%N A330199 Expansion of e.g.f. Product_{k>=1} exp(1 - exp(x^k)).
%H A330199 Seiichi Manyama, <a href="/A330199/b330199.txt">Table of n, a(n) for n = 0..450</a>
%F A330199 E.g.f.: A(x) = Product_{k>=1} B(x^k), where B(x) = e.g.f. of complementary Bell numbers (A000587).
%F A330199 E.g.f.: exp(-Sum_{j>=1} Sum_{i>=1} x^(i*j) / i!).
%F A330199 a(0) = 1; a(n) = -Sum_{k=1..n} binomial(n-1,k-1) * A057625(k) * a(n-k).
%t A330199 nmax = 22; CoefficientList[Series[Product[Exp[1 - Exp[x^k]], {k, 1, nmax}], {x, 0, nmax}], x] Range[0, nmax]!
%t A330199 a[0] = 1; a[n_] := a[n] = -Sum[Binomial[n - 1, k - 1] k! DivisorSum[k, 1/#! &] a[n - k], {k, 1, n}]; Table[a[n], {n, 0, 22}]
%Y A330199 Cf. A000587, A057625, A209903.
%K A330199 sign
%O A330199 0,3
%A A330199 _Ilya Gutkovskiy_, Dec 05 2019