Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A106624
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A106624 Cumulative column frequency of occurrence of 0's and 1's iterated in a binary tree where each node in the tree holds a value of 0 or 1, beginning with a count of 1. +0
1
1, 0, 2, 1, 4, 3, 8, 7, 16, 15, 32, 31, 64, 63, 128, 127, 256, 255, 512, 511, 1024, 1023, 2048, 2047, 4096, 4095, 8192, 8191, 16384, 16383, 32768, 32767, 65536, 65535, 131072, 131071, 262144, 262143, 524288, 524287, 1048576, 1048575, 2097152 (list; table; graph; listen)
OFFSET

0,3

REFERENCES

Douglas Comer, Ubiquitous B-Tree, ACM Computing Surveys (CSUR), (1979), Volume 11 Issue 2.

Huffman, D. A., A method for the construction of minimum redundancy codes, Proc. IRE 40 (1951), 1098-1101.

Knuth, D. E., Dynamic Huffman coding. J. Algorithms 6 (1985), 163-180.

LINKS

Barnes, G.C. et al., Balanced sample Binary Trees .

Fenwick, P.N. Cumulative Frequency.

Witteveen, C.Balanced Binary Trees .

FORMULA

-1/2*x^3+1/2*x^2-1/2+(x^4-3/2*x^2+1/2)*F(x) = 0

MAPLE

A106624 := proc(n) coeftayl( (1/2*x^3-1/2*x^2+1/2)/(x^4-3/2*x^2+1/2), x=0, n) ; end: seq(A106624(n), n=0..80) ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 13 2008

CROSSREFS

Cf. A016116.

Cf. A014535, A037026, A058521, A058518, A058519, A058520.

Sequence in context: A087787 A100818 A005291 this_sequence A106622 A028297 A114438

Adjacent sequences: A106621 A106622 A106623 this_sequence A106625 A106626 A106627

KEYWORD

easy,nonn,tabl

AUTHOR

R. H. Barbour (bbarbour(AT)unitec.ac.nz), May 10 2005

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 13 2008

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research