[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Revision History for A052710 (Underlined text is an addition; strikethrough text is a deletion.)

Showing all changes.
A052710 A simple context-free grammar.
(history; published version)
#9 by N. J. A. Sloane at Tue Apr 18 07:04:02 EDT 2017
LINKS

INRIA Algorithms Project, <a href="http://algoecs.inria.fr/ecsservices/ecsstructure?searchType=1&amp;service=Search&amp;searchTermsnbr=665">Encyclopedia of Combinatorial Structures 665</a>

Discussion
Tue Apr 18 07:04
OEIS Server: https://oeis.org/edit/global/2632
#8 by Charles R Greathouse IV at Thu Dec 01 11:32:11 EST 2011
LINKS

INRIA Algorithms Project, <a href="http://algo.inria.fr/binecs/encyclopediaecs?SearchsearchType=1&amp;service=ECSnbSearch&amp;argsearchsearchTerms=665">Encyclopedia of Combinatorial Structures 665</a>

Discussion
Thu Dec 01 11:32
OEIS Server: https://oeis.org/edit/global/103
#7 by N. J. A. Sloane at Thu Nov 11 07:34:06 EST 2010
LINKS

INRIA Algorithms Project, <a href="http://algo.inria.fr/bin/encyclopedia?Search=ECSnb&amp;argsearch=665">Encyclopedia of Combinatorial Structures 665</a>

KEYWORD

easy,nonn,new

#6 by N. J. A. Sloane at Fri Feb 24 03:00:00 EST 2006
FORMULA

Recurrence: {a(1)=0,, a(2)=0,, a(4)=1,, a(3)=0,, a(5)=4,, a(6)=14,(, (2304-4608*n-36864*n^2+73728*n^3)*a(n)+(46368+121536*n+59904*n^2-9216*n^3)*a(n+1)+(-79800-56512*n+59520*n^2+34048*n^3)*a(n+2)+(200516*n+185964+68544*n^2+7456*n^3)*a(n+3)+(-15024*n^2-22732*n+6864-2228*n^3)*a(n+4)+(-217*n^3-2604*n^2-10199*n-13020)*a(n+5)}

KEYWORD

easy,nonn,new

#5 by N. J. A. Sloane at Sat Jun 12 03:00:00 EDT 2004
MAPLE

spec:= [ := [S, {C=Prod(B, B), S=Prod(C, C), B=Union(S, C, Z)}, unlabeled]: seq(combstruct[count](spec, size=n), n=0..20);

KEYWORD

easy,nonn,new

#4 by N. J. A. Sloane at Thu Feb 19 03:00:00 EST 2004
MAPLE

spec:= [S, {C=Prod(B, B), S=Prod(C, C), B=Union(S, C, Z)}, unlabelledunlabeled]: seq(combstruct[count](spec, size=n), n=0..20);

KEYWORD

easy,nonn,new

#3 by N. J. A. Sloane at Fri May 16 03:00:00 EDT 2003
LINKS

<INRIA Algorithms Project, <a href="http://algo.inria.fr/bin/encyclopedia?Search=ECSnb&argsearch=665">Encyclopedia of Combinatorial Structures 665</a>

MAPLE

spec:= [S, {C=Prod(B, B), S=Prod(C, C), B=Union(S, C, Z)}, unlabelled]:]: seq(combstruct[count](spec, size=n), ), n=0..20);

KEYWORD

easy,nonn,new

AUTHOR

encyclopedia@(AT)pommard.inria.fr, Jan 25 2000

#2 by N. J. A. Sloane at Sat Jul 22 03:00:00 EDT 2000
LINKS

<a href="http://algo.inria.fr/bin/encyclopedia?Search=ECSnb&argsearch=665">ECSEncyclopedia of Combinatorial Structures 665</a>

KEYWORD

easy,nonn,new

#1 by N. J. A. Sloane at Mon May 08 03:00:00 EDT 2000
NAME

A simple context-free grammar.

DATA

0, 0, 0, 0, 1, 4, 14, 52, 201, 792, 3168, 12844, 52676, 218148, 910996, 3832072, 16222352, 69061200, 295477550, 1269863304, 5479456290

OFFSET

0,6

LINKS

<a href="http://algo.inria.fr/bin/encyclopedia?Search=ECSnb&argsearch=665">ECS 665</a>

FORMULA

G.f.: RootOf(-_Z+_Z^4+_Z^2+x)-RootOf(-_Z+_Z^4+_Z^2+x)^2-x

Recurrence: {a(1)=0,a(2)=0,a(4)=1,a(3)=0,a(5)=4,a(6)=14,(2304-4608*n-36864*n^2+73728*n^3)*a(n)+(46368+121536*n+59904*n^2-9216*n^3)*a(n+1)+(-79800-56512*n+59520*n^2+34048*n^3)*a(n+2)+(200516*n+185964+68544*n^2+7456*n^3)*a(n+3)+(-15024*n^2-22732*n+6864-2228*n^3)*a(n+4)+(-217*n^3-2604*n^2-10199*n-13020)*a(n+5)}

MAPLE

spec:= [S, {C=Prod(B, B), S=Prod(C, C), B=Union(S, C, Z)}, unlabelled]:seq(combstruct[count](spec, size=n), n=0..20);

KEYWORD

easy,nonn

AUTHOR

encyclopedia@pommard.inria.fr, Jan 25 2000

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 09:12 EDT 2024. Contains 375511 sequences. (Running on oeis4.)