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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A131893 a(n) is the number of shapes of balanced trees with constant branching factor 7 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, 7, 21, 35, 35, 21, 7, 1, 49, 1029, 12005, 84035, 352947, 823543, 823543, 17294403, 155649627, 778248135, 2334744405, 4202539929, 4202539929, 1801088541, 21012699645, 105063498225, 291843050625, 486405084375, 486405084375 (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(7n+1+m) = (7 choose m) * a(n+1)^m * a(n)^(7-m), where n >= 0 and 0 <= m <= 7.

CROSSREFS

Cf. A110316, A131889, A131890, A131891, A131892.

Sequence in context: A001485 A087111 A173676 * A045849 A031008 A147587

Adjacent sequences:  A131890 A131891 A131892 * A131894 A131895 A131896

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 17 19:13 EST 2012. Contains 206085 sequences.