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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A176452 Irregular triangle read by rows: T(n,k) = number of Huffman-equivalence classes of ternary trees with 2n+1 leaves and 3k leaves on the bottom level (n>=1, k>=1). 3
1, 1, 1, 1, 2, 1, 1, 4, 2, 1, 7, 4, 2, 13, 7, 4, 1, 25, 13, 7, 2, 1, 48, 25, 13, 3, 2, 1, 92, 48, 25, 6, 3, 2, 176, 92, 48, 12, 6, 3, 1, 338, 176, 92, 23, 12, 6, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

REFERENCES

J. Paschke et al., Computing and estimating the number of n-ary Huffman sequences of a specified length, Discrete Math., 311 (2011), 1-7.

LINKS

Table of n, a(n) for n=1..48.

EXAMPLE

Triangle begins:

1

1

1 1

2 1 1

4 2 1

7 4 2

13 7 4 1

25 13 7 2 1

48 25 13 3 2 1

92 48 25 6 3 2

176 92 48 12 6 3 1

338 176 92 23 12 6 1

CROSSREFS

Cf. A176431. A176463. Leading column is A176485.

Sequence in context: A156861 A122773 A029268 * A064191 A127420 A129033

Adjacent sequences:  A176449 A176450 A176451 * A176453 A176454 A176455

KEYWORD

nonn,more,tabf

AUTHOR

N. J. A. Sloane, Dec 07 2010

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified February 23 11:41 EST 2018. Contains 299579 sequences. (Running on oeis4.)