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.
%I A301655 #13 Oct 09 2018 07:58:08
%S A301655 1,1,5,44,723,24655,1715816,239697569,69557364821,41297123651644,
%T A301655 49900451628509015,125141540794392423599,641579398300246011553552,
%U A301655 6729809577032172543373047313,146355880526667013027682326650073,6505380999057202235872595196799580684
%N A301655 a(n) = [x^n] 1/(1 - Sum_{k>=1} k^n*x^k).
%C A301655 Number of compositions (ordered partitions) of n where there are k^n sorts of part k.
%C A301655 a(n) is the n-th term of invert transform of n-th powers.
%H A301655 Vaclav Kotesovec, <a href="/A301655/b301655.txt">Table of n, a(n) for n = 0..79</a>
%H A301655 N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>
%H A301655 <a href="/index/Com#comp">Index entries for sequences related to compositions</a>
%F A301655 a(n) = [x^n] 1/(1 - PolyLog(-n,x)), where PolyLog() is the polylogarithm function.
%F A301655 From _Vaclav Kotesovec_, Mar 27 2018: (Start)
%F A301655 a(n) ~ 3^(n^2/3) if mod(n,3)=0
%F A301655 a(n) ~ 3^(n*(n-4)/3-2)*2^(2*n-1)*(n-1)*(n+8) if mod(n,3)=1
%F A301655 a(n) ~ 3^((n+1)*(n-3)/3)*2^n*(n+1) if mod(n,3)=2
%F A301655 (End)
%t A301655 Table[SeriesCoefficient[1/(1 - Sum[k^n x^k, {k, 1, n}]), {x, 0, n}], {n, 0, 15}]
%t A301655 Table[SeriesCoefficient[1/(1 - PolyLog[-n, x]), {x, 0, n}], {n, 0, 15}]
%Y A301655 Main diagonal of A320251.
%Y A301655 Cf. A001906, A033453, A053506, A144109, A193678, A221460, A252782, A292194.
%K A301655 nonn
%O A301655 0,3
%A A301655 _Ilya Gutkovskiy_, Mar 25 2018