Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A048828
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A048828 Number of identity (asymmetric) trees of width n. +0
2
1, 0, 0, 0, 0, 1, 4, 66, 65328, 2146402440 (list; graph; listen)
OFFSET

0,7

LINKS

Index entries for sequences related to trees

FORMULA

a(2n)=2^(c(n-2))*(2^b(n-1)-b(n-1)-1), a(2n+1)=b(n)*(b(n)-1)/2, b: A038081. c: A014221.

CROSSREFS

Sequence in context: A041119 A015475 A025585 this_sequence A003360 A083931 A133881

Adjacent sequences: A048825 A048826 A048827 this_sequence A048829 A048830 A048831

KEYWORD

nonn

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), Jun 15 1999.

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research