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.

A218021 Shifts 4 places left under Euler transform with a(0)=0 and a(n)=1 for n < 4.

This page as a plain text file.
%I A218021 #19 May 08 2019 14:34:31
%S A218021 0,1,1,1,1,1,2,3,5,7,12,18,30,47,78,125,209,341,571,946,1592,2663,
%T A218021 4503,7594,12898,21891,37334,63691,109039,186816,320913,551829,950842,
%U A218021 1640149,2833866,4901658,8490019,14720477,25553525,44401638,77232183,134457819
%N A218021 Shifts 4 places left under Euler transform with a(0)=0 and a(n)=1 for n < 4.
%H A218021 Alois P. Heinz, <a href="/A218021/b218021.txt">Table of n, a(n) for n = 0..1000</a>
%H A218021 N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>
%F A218021 a(n) ~ c * d^n / n^(3/2), where d = 1.8065918193702780027972... and c = 1.041173202249532389463... . - _Vaclav Kotesovec_, Jun 23 2014
%F A218021 G.f.: x + x^2 + x^3 + x^4 / Product_{n>=1} (1 - x^n)^a(n). - _Ilya Gutkovskiy_, May 08 2019
%p A218021 with(numtheory):
%p A218021 b:= proc(n) option remember; `if`(n=0, 1,
%p A218021       (add(add(d*a(d), d= divisors(j)) *b(n-j), j=1..n))/n)
%p A218021     end:
%p A218021 a:= n-> `if`(n<4, signum(n), b(n-4)):
%p A218021 seq(a(n), n=0..45);
%t A218021 b[n_] := b[n] = If[n == 0, 1, (Sum[Sum[d*a[d], {d, Divisors[j]}]*b[n - j], {j, 1, n }])/n]; a[n_] := If[n < 4, Sign[n], b[n - 4]]; Table[a[n], {n, 0, 41}] (* _Jean-François Alcover_, Aug 01 2013, after _Alois P. Heinz_ *)
%Y A218021 Column k=4 of A144018.
%Y A218021 Cf. A316076.
%K A218021 nonn,eigen
%O A218021 0,7
%A A218021 _Alois P. Heinz_, Oct 18 2012