Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A058519
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A058519 Number of directed cycles of B-trees of order 3 with n labeled leaves. +0
3
0, 1, 2, 3, 5, 8, 15, 24, 46, 82, 157, 293, 576, 1095, 2138, 4156, 8162, 16019, 31675, 62608, 124341, 247224, 493067, 984905, 1971970, 3953749, 7941397, 15971775, 32168510, 64866564, 130959749, 264676274, 535488128, 1084424916 (list; graph; listen)
OFFSET

0,3

MAPLE

spec := [C, {B=Union(Z, Subst(M, B)), M=Union(Prod(Z, Z), Prod(Z, Z, Z)), C=Cycle(B)}]; [seq(combstruct[count](spec, size=n), n=0..40)];

CROSSREFS

Cf. A058518, A014535.

Adjacent sequences: A058516 A058517 A058518 this_sequence A058520 A058521 A058522

Sequence in context: A104880 A102973 A066372 this_sequence A082095 A006982 A054539

KEYWORD

nonn

AUTHOR

njas, Dec 21 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 October 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research