Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A052866
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A052866 A simple grammar. +0
1
1, 2, 5, 19, 97, 621, 4771, 42673, 434673, 4959433, 62569891, 863989941, 12949163833, 209203422013, 3622195815603, 66881477554921, 1311357008557921, 27202303879342353, 595035842021131843 (list; graph; listen)
OFFSET

0,2

LINKS

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 835

FORMULA

E.g.f.: (-x-exp(-x/(-1+x))+exp(-x/(-1+x))*x)/(-1+x)

Recurrence: {a(0)=1, a(1)=2, a(2)=5, (-n^3-2*n-3*n^2)*a(n)+(3*n^2+10*n+8)*a(n+1)+(-3*n-7)*a(n+2)+a(n+3)}

a(n) = n!+A000262(n). - Vladeta Jovovic (vladeta(AT)eunet.rs), Nov 29 2002

MAPLE

spec := [S, {B=Sequence(Z, 1 <= card), C=Set(B), S=Union(B, C)}, labeled]: seq(combstruct[count](spec, size=n), n=0..20);

CROSSREFS

Sequence in context: A020109 A020015 A049984 this_sequence A007003 A020117 A054687

Adjacent sequences: A052863 A052864 A052865 this_sequence A052867 A052868 A052869

KEYWORD

easy,nonn

AUTHOR

encyclopedia(AT)pommard.inria.fr, Jan 25 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