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 A294986 #10 Sep 20 2019 05:06:41
%S A294986 1,41245,4561368175,1104353764428365,396695587555058190126,
%T A294986 174436242482643190451211853,86237678200608256132213084584295,
%U A294986 46050764886573707269872023694736134925,25997337847684377365651388718120083246723460
%N A294986 Number of compositions (ordered partitions) of 1 into exactly 7n+1 powers of 1/(n+1).
%H A294986 Alois P. Heinz, <a href="/A294986/b294986.txt">Table of n, a(n) for n = 0..170</a>
%F A294986 a(n) ~ 7^(7*n + 3/2) / (8 * Pi^3 * n^3). - _Vaclav Kotesovec_, Sep 20 2019
%p A294986 b:= proc(n, r, p, k) option remember;
%p A294986 `if`(n<r, 0, `if`(r=0, `if`(n=0, p!, 0), add(
%p A294986 b(n-j, k*(r-j), p+j, k)/j!, j=0..min(n, r))))
%p A294986 end:
%p A294986 a:= n-> (k-> `if`(n=0, 1, b(k*n+1, 1, 0, n+1)))(7):
%p A294986 seq(a(n), n=0..12);
%t A294986 b[n_, r_, p_, k_] := b[n, r, p, k] = If[n < r, 0, If[r == 0, If[n == 0, p!, 0], Sum[b[n - j, k*(r - j), p + j, k]/j!, {j, 0, Min[n, r]}]]];
%t A294986 a[n_] := If[n == 0, 1, b[#*n + 1, 1, 0, n + 1]]&[7];
%t A294986 Table[a[n], {n, 0, 12}] (* _Jean-François Alcover_, May 21 2018, translated from Maple *)
%Y A294986 Row n=7 of A294746.
%K A294986 nonn
%O A294986 0,2
%A A294986 _Alois P. Heinz_, Nov 12 2017