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 A102881 #17 Jan 30 2020 22:07:14
%S A102881 1,1,2,6,12,32,80,200,520,1336,3472,9072,23744,62432,164544,434688,
%T A102881 1150944,3052768,8110784,21581120,57498496,153378048,409583616,
%U A102881 1094848768,2929288960,7843943680,21020501504,56371941888,151276652544
%N A102881 Expansion of (1+x)/sqrt(1-4x^2-8x^3-4x^4).
%C A102881 Binomial transform is A101500. Binomial transform of A102882.
%C A102881 Apparently the number of grand Motzkin paths of length n that avoid FF (double flat steps). - _David Scambler_, Jul 04 2013
%H A102881 Vincenzo Librandi, <a href="/A102881/b102881.txt">Table of n, a(n) for n = 0..1000</a>
%F A102881 G.f.: (1+x)/sqrt((1-2x-2x^2)(1+2x+2x^2)).
%F A102881 D-finite with recurrence: n*a(n) +(n-2)*a(n-1) +4*(-n+1)*a(n-2) +12*(-n+2)*a(n-3) +12*(-n+3)*a(n-4) +4*(-n+4)*a(n-5)=0. - _R. J. Mathar_, Nov 16 2012
%F A102881 D-finite with recurrence (of order 4): (n-1)*n*a(n) = 4*(n-1)^2*a(n-2) + 4*(n-2)*(2*n-1)*a(n-3) + 4*(n-3)*n*a(n-4). - _Vaclav Kotesovec_, Feb 08 2014
%F A102881 a(n) ~ sqrt(54+30*sqrt(3)) * (1+sqrt(3))^n / (12 * sqrt(Pi*n)). - _Vaclav Kotesovec_, Feb 08 2014
%t A102881 CoefficientList[Series[(1+x)/Sqrt[1-4*x^2-8*x^3-4*x^4], {x, 0, 20}], x] (* _Vaclav Kotesovec_, Feb 08 2014 *)
%K A102881 easy,nonn
%O A102881 0,3
%A A102881 _Paul Barry_, Jan 15 2005