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 A026572 #15 May 10 2020 13:43:09 %S A026572 1,2,8,19,56,140,376,953,2474,6286,16097,40880,104069,264052,670414, %T A026572 1699831,4310546,10924970,27690075,70168812,177820791,450618964, %U A026572 1142004584,2894347667,7336297080,18597140982,47148420564 %N A026572 a(n) = T(n,n-3), T given by A026568. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=3. %C A026572 Also, a(n) = T(n,n-3), T given by A026584. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=3. %F A026572 Conjectured g.f.: (1/2)*((-3*x^2-x+1)*((x-1)/(4*x^2+x-1))^(1/2)-1+x+x^2)/x^3. - _Mark van Hoeij_, Oct 30 2011 %F A026572 Conjecture: (n+3)*a(n) +(-3*n-5)*a(n-1) +4*(-n-1)*a(n-2) +(13*n-9)*a(n-3) +(5*n-9)*a(n-4) +6*(-2*n+7)*a(n-5)=0. - _R. J. Mathar_, Jun 23 2013 %Y A026572 Cf. A026568, A026584. %K A026572 nonn %O A026572 3,2 %A A026572 _Clark Kimberling_