cp's OEIS Frontend

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.

A052610 E.g.f. 1/(1-x-2x^3).

This page as a plain text file.
%I A052610 #13 Jun 03 2022 18:46:21
%S A052610 1,1,2,18,120,840,9360,115920,1491840,22861440,395539200,7304774400,
%T A052610 148011494400,3281639961600,77850214041600,1975895970048000,
%U A052610 53666956062720000,1547595999645696000,47204701332332544000
%N A052610 E.g.f. 1/(1-x-2x^3).
%H A052610 INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=555">Encyclopedia of Combinatorial Structures 555</a>
%F A052610 E.g.f.: -1/(-1+x+2*x^3)
%F A052610 Recurrence: {a(1)=1, a(0)=1, a(2)=2, (-12*n^2-22*n-12-2*n^3)*a(n) +(-n-3)*a(n+2) +a(n+3)=0}
%F A052610 Sum(1/29*(2+6*_alpha^2+9*_alpha)*_alpha^(-1-n), _alpha=RootOf(-1+_Z+2*_Z^3))*n!
%F A052610 a(n)=n!*A077949(n). - _R. J. Mathar_, Jun 03 2022
%p A052610 spec := [S,{S=Sequence(Union(Z,Prod(Z,Z,Union(Z,Z))))},labeled]: seq(combstruct[count](spec,size=n), n=0..20);
%K A052610 easy,nonn
%O A052610 0,3
%A A052610 encyclopedia(AT)pommard.inria.fr, Jan 25 2000