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 A008747 #52 Sep 08 2022 08:44:36
%S A008747 1,1,2,3,5,6,9,11,14,17,21,24,29,33,38,43,49,54,61,67,74,81,89,96,105,
%T A008747 113,122,131,141,150,161,171,182,193,205,216,229,241,254,267,281,294,
%U A008747 309,323,338,353,369,384,401,417,434,451,469,486,505,523,542,561
%N A008747 Expansion of (1+x^4)/((1-x)*(1-x^2)*(1-x^3)).
%C A008747 For n>=1, the set {A008747(6n+-1)} is the set of numbers of the form a^2 + 5*(a+1)^2 for -inf < a < inf. Furthermore the set A008747(6n) is A033581(n). - _Kieren MacMillan_, Dec 19 2007
%C A008747 For n>1, a(n-1) is the number of aperiodic necklaces (Lyndon words) with k<=3 black beads and n-k white beads. For n=4 we have for example a(3)=3 aperiodic necklaces: BWWW, BBWW and BBBW. BWBW is periodic and is not counted. - _Herbert Kociemba_, Oct 23 2016
%H A008747 Seiichi Manyama, <a href="/A008747/b008747.txt">Table of n, a(n) for n = 0..10000</a>
%H A008747 Robert Morris, <a href="https://arxiv.org/abs/math/0702370">Minimal percolating sets in bootstrap percolation</a>, arXiv:math/0702370 [math.CO], 2007-2008.
%H A008747 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,0,-1,-1,1).
%F A008747 G.f.: (1+x^4)/((1-x)*(1-x^2)*(1-x^3)).
%F A008747 a(n) = ceiling((n+1)^2/6).
%F A008747 a(n) = (12*n + 23 + 6*n^2 + 9*(-1)^n + 4*A061347(n))/36. - _R. J. Mathar_, Mar 15 2011
%F A008747 a(0)=1, a(1)=1, a(2)=2, a(3)=3, a(4)=5, a(5)=6, a(n) = a(n-1) + a(n-2) - a(n-4) - a(n-5) + a(n-6) for n > 5. - _Harvey P. Dale_, Sep 05 2012
%F A008747 From _Michael Somos_, Oct 25 2016: (Start)
%F A008747 Euler transform of length 8 sequence [ 1, 1, 1, 1, 0, 0, 0, -1].
%F A008747 a(n) = a(-2-n) for all n in Z.
%F A008747 a(2*n-1) = A071619(n).
%F A008747 a(3*n-1) = 2*A077043(n).
%F A008747 a(n) - a(n-1) = A051274(n). (End)
%e A008747 G.f. = 1 + x + 2*x^2 + 3*x^3 + 5*x^4 + 6*x^5 + 9*x^6 + 11*x^7 + 14*x^8 + ...
%p A008747 A008747:=n->ceil((n+1)^2/6): seq(A008747(n), n=0..100); # _Wesley Ivan Hurt_, Oct 25 2016
%t A008747 CoefficientList[Series[(1+x^4)/((1-x)(1-x^2)(1-x^3)),{x,0,60}],x] (* or *) LinearRecurrence[{1,1,0,-1,-1,1},{1,1,2,3,5,6},60] (* _Harvey P. Dale_, Sep 05 2012 *)
%o A008747 (PARI) Vec((1+x^4)/((1-x)*(1-x^2)*(1-x^3))+O(x^60)) \\ _Charles R Greathouse IV_, Sep 25 2012
%o A008747 (Magma) R<x>:=PowerSeriesRing(Integers(), 60); Coefficients(R!( (1+x^4)/((1-x)*(1-x^2)*(1-x^3)) )); // _G. C. Greubel_, Aug 03 2019
%o A008747 (Sage) ((1+x^4)/((1-x)*(1-x^2)*(1-x^3))).series(x, 60).coefficients(x, sparse=False) # _G. C. Greubel_, Aug 03 2019
%o A008747 (GAP) a:=[1,1,2,3,5,6];; for n in [7..60] do a[n]:=a[n-1]+a[n-2]-a[n-4] -a[n-5]+a[n-6]; od; a; # _G. C. Greubel_, Aug 03 2019
%Y A008747 Cf. A008747, A033581, A051274, A061347, A071619, A077043.
%K A008747 nonn,easy
%O A008747 0,3
%A A008747 _N. J. A. Sloane_