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 A299026 #9 Dec 02 2018 03:21:47
%S A299026 1,2,4,8,16,31,59,111,205,378,685,1238,2213,3940,6955,12221,21333,
%T A299026 37074,64073,110267,188877,322244,547522,926903,1563370,2628008,
%U A299026 4402927,7353656,12244434,20329271,33657560,55574996,91525882,150356718,246403694,402861907
%N A299026 Number of compositions of n whose standard factorization into Lyndon words has all weakly increasing factors.
%H A299026 Andrew Howroyd, <a href="/A299026/b299026.txt">Table of n, a(n) for n = 1..1000</a>
%F A299026 Euler transform of A167934.
%e A299026 The 2^6 - a(7) = 5 compositions of 7 whose Lyndon prime factors are not all weakly increasing: (11212), (1132), (1213), (1321), (142).
%t A299026 nn=50;
%t A299026 ser=Product[1/(1-x^n)^(PartitionsP[n]-DivisorSigma[0,n]+1),{n,nn}];
%t A299026 Table[SeriesCoefficient[ser,{x,0,n}],{n,nn}]
%o A299026 (PARI) EulerT(v)={Vec(exp(x*Ser(dirmul(v,vector(#v,n,1/n))))-1, -#v)}
%o A299026 seq(n)={EulerT(vector(n, n, numbpart(n) - numdiv(n) + 1))} \\ _Andrew Howroyd_, Dec 01 2018
%Y A299026 Cf. A001045, A032153, A034691, A049311, A059966, A098407, A167934, A185700, A270995, A296373, A299023, A299024, A299027.
%K A299026 nonn
%O A299026 1,2
%A A299026 _Gus Wiseman_, Feb 01 2018