Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A052947
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A052947 A simple regular expression. +0
13
1, 0, 1, 2, 1, 4, 5, 6, 13, 16, 25, 42, 57, 92, 141, 206, 325, 488, 737, 1138, 1713, 2612, 3989, 6038, 9213, 14016, 21289, 32442, 49321, 75020, 114205, 173662, 264245, 402072, 611569, 930562, 1415713, 2153700, 3276837, 4985126, 7584237, 11538800 (list; graph; listen)
OFFSET

0,4

LINKS

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 1006

FORMULA

G.f.: -1/(-1+2*x^3+x^2)

Recurrence: {a(1)=0, a(0)=1, a(2)=1, 2*a(n)+a(n+1)-a(n+3)}

Sum(-1/52*(-3-17*_alpha+2*_alpha^2)*_alpha^(-1-n), _alpha=RootOf(_Z^2+2*_Z^3-1))

a(n)=a(n-2)+2a(n-3); a(n)=sum{k=0..floor(n/2), binomial(k, n-2k)2^(n-2k)}. - Paul Barry (pbarry(AT)wit.ie), Oct 16 2004

MAPLE

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

CROSSREFS

Sequence in context: A058359 A110332 A159287 this_sequence A021992 A080030 A125156

Adjacent sequences: A052944 A052945 A052946 this_sequence A052948 A052949 A052950

KEYWORD

easy,nonn

AUTHOR

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

EXTENSIONS

More terms from James A. Sellers (sellersj(AT)math.psu.edu), Jun 05 2000

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research