Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A052828
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A052828 A simple grammar: union of cycles and cycles of cycles. +0
1
0, 2, 3, 9, 41, 252, 1954, 18302, 200906, 2528152, 35862456, 565985472, 9834073248, 186504365616, 3833188731072, 84862243895088, 2013237501351504, 50950031663224320, 1370088133344414336 (list; graph; listen)
OFFSET

0,2

LINKS

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 793

FORMULA

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

MAPLE

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

CROSSREFS

Sequence in context: A095412 A074428 A125052 this_sequence A012972 A037389 A037425

Adjacent sequences: A052825 A052826 A052827 this_sequence A052829 A052830 A052831

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 September 5 01:44 EDT 2008. Contains 143476 sequences.


AT&T Labs Research