Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098824
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098824 Array read by antidiagonals: Minimizing absolutely ordered sequences of m-ary Huffman trees of maximum height; m > 1. +0
1
1, 1, 1, 2, 1, 1, 3, 1, 1, 1, 5, 2, 1, 1, 1, 8, 2, 1, 1, 1, 1, 13, 4, 2, 1, 1, 1, 1, 21, 4, 2, 1, 1, 1, 1, 1, 34, 8, 2, 2, 1, 1, 1, 1, 1, 55, 8, 5, 2, 1, 1, 1, 1, 1, 1, 89, 16, 5, 2, 2, 1, 1, 1, 1, 1, 1, 144, 16, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 233, 32, 11, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 377, 32, 11, 6, 2 (list; table; graph; listen)
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 9 14:43 EST 2009. Contains 170430 sequences.


AT&T Labs Research