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.

A363339 G.f. satisfies A(x) = exp( Sum_{k>=1} (-1)^(k+1) * A(x^(4*k)) * x^k/k ).

This page as a plain text file.
%I A363339 #17 May 31 2023 10:48:44
%S A363339 1,1,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,1,2,1,0,0,1,1,0,0,
%T A363339 0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
%U A363339 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,1,2,1,0,0,1,1,0,0,0,0,0,1,1,0,0,2,4,2,0,1,5,5,1,0
%N A363339 G.f. satisfies A(x) = exp( Sum_{k>=1} (-1)^(k+1) * A(x^(4*k)) * x^k/k ).
%H A363339 Seiichi Manyama, <a href="/A363339/b363339.txt">Table of n, a(n) for n = 0..1000</a>
%F A363339 A(x) = Sum_{k>=0} a(k) * x^k = Product_{k>=0} (1+x^(4*k+1))^a(k).
%F A363339 A(x) * A(i*x) * A(-x) * A(i^3*x) = A(-x^4), where i=sqrt(-1).
%F A363339 a(0) = 1; a(n) = (1/n) * Sum_{k=1..n} ( Sum_{d|k and d==1 mod 4} (-1)^(k/d+1) * d * a(floor(d/4)) ) * a(n-k).
%o A363339 (PARI) seq(n) = my(A=1); for(i=1, n, A=exp(sum(k=1, i, (-1)^(k+1)*subst(A, x, x^(4*k))*x^k/k)+x*O(x^n))); Vec(A);
%Y A363339 Cf. A004111, A318133, A363338.
%Y A363339 Cf. A363337.
%K A363339 nonn
%O A363339 0,27
%A A363339 _Seiichi Manyama_, May 28 2023