Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A038083
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A038083 Number of n-node rooted identity trees of height at most 4. +0
4
1, 1, 1, 2, 3, 5, 7, 10, 13, 18, 24, 32, 41, 52, 66, 83, 102, 124, 152, 181, 216, 255, 299, 346, 400, 458, 521, 588, 659, 735, 814, 896, 979, 1067, 1151, 1239, 1324, 1407, 1486, 1564, 1635, 1700, 1759, 1809, 1853, 1887, 1912, 1925, 1932, 1925, 1912 (list; graph; listen)
OFFSET

1,4

COMMENT

97 terms.

LINKS

N. J. A. Sloane, Transforms

Index entries for sequences related to rooted trees

FORMULA

Take Weigh transform of A038082 and shift right.

MAPLE

weigh:= proc(p) proc(n) `if`(n<0, 1, coeff (mul ((1+x^k)^p(k), k=1..n), x, n)) end end: wsh:= p-> n-> weigh(p)(n-1): a:= wsh (n-> `if`(n>0 and n<12, [1$3, 2$5, 1$3][n], 0)): seq (a(n), n=1..97); [From Alois P. Heinz (heinz(AT)hs-heilbronn.de), Sep 10 2008]

CROSSREFS

Cf. A038081-A038093.

Sequence in context: A038499 A118199 A088318 this_sequence A060688 A005691 A035954

Adjacent sequences: A038080 A038081 A038082 this_sequence A038084 A038085 A038086

KEYWORD

nonn,fini

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), Jan 04 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 December 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research