login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A131890 a(n) is the number of shapes of balanced trees with constant branching factor 4 and n nodes. The node is balanced if the size, measured in nodes, of each pair of its children differ by at most one node. 4
1, 4, 6, 4, 1, 16, 96, 256, 256, 1536, 3456, 3456, 1296, 3456, 3456, 1536, 256, 256, 96, 16, 1, 64, 1536, 16384, 65536, 1572864, 14155776, 56623104, 84934656, 905969664, 3623878656, 6442450944, 4294967296, 17179869184, 25769803776, 17179869184 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

LINKS

Jeffrey A. Barnett Counting Balanced Tree Shapes.

FORMULA

a(0) = a(1) = 1; a(4n+1+m) = (4 choose m) * a(n+1)^m * a(n)^(4-m), where n >= 0 and 0 <= m <= 4.

CROSSREFS

Cf. A110316, A131889, A131891, A131892, A131893.

Sequence in context: A063422 A010670 A199358 * A062751 A135911 A164356

Adjacent sequences:  A131887 A131888 A131889 * A131891 A131892 A131893

KEYWORD

easy,nonn

AUTHOR

Jeffrey A. Barnett (jbb(AT)notatt.com), Jul 24 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 13 18:46 EST 2012. Contains 205535 sequences.