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 A130711 #11 Sep 21 2024 22:56:12
%S A130711 1,2,4,8,14,32,57,123,239,493,970,1997,3953,8017,16024,32281,64550,
%T A130711 129742,259561,520606,1041871,2087177,4176594,8362063,16730862,
%U A130711 33483361,66987710,134029333,268117646,536373213,1072909785,2146169660
%N A130711 Number of compositions of n such that the smallest part divides every part.
%F A130711 Inverse Moebius transform of A099036.
%F A130711 G.f.: Sum_{n>0} x^n*(1-x^n)^2/((1-2*x^n)*(1-x^n-x^(2*n))).
%e A130711 a(5)=14 because among the 16 compositions of 5 only 2+3 and 3+2 do not qualify; the others, except for the composition 5, have at least one component equal to 1.
%p A130711 G:=sum(x^n*(1-x^n)^2/((1-2*x^n)*(1-x^n-x^(2*n))), n=1..50); Gser:=series(G, x =0,40): seq(coeff(Gser,x,n),n=1..33); # _Emeric Deutsch_, Sep 08 2007
%Y A130711 Cf. A083710.
%K A130711 easy,nonn
%O A130711 1,2
%A A130711 _Vladeta Jovovic_, Jul 01 2007
%E A130711 More terms from _Emeric Deutsch_, Sep 08 2007