|
Search: id:A059939
|
|
| |
|
| 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5
(list; graph; listen)
|
|
|
OFFSET
|
1,7
|
|
|
REFERENCES
|
Y. S. Song, On the combinatorics of rooted binary phylogenetic trees, Annals of Combinatorics, 7, 2003, 365-379.
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,1024
|
|
FORMULA
|
a(n)=A000523(n+1)-1=floor[log10(A007931(n))]
|
|
EXAMPLE
|
a(6)=[log2(7)-1]=[1.807..]=1; a(7)=[log2(8)-1]=[2]=2; a(8)=[log2(9)-1]=[2.169..]=2
|
|
PROGRAM
|
(PARI) { a=0; p=4; for (n=1, 1024, if (n + 1 == p, a++; p*=2; ); write("b059939.txt", n, " ", a); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jun 30 2009]
|
|
CROSSREFS
|
Sequence in context: A108582 A071840 A000193 this_sequence A071842 A085141 A082896
Adjacent sequences: A059936 A059937 A059938 this_sequence A059940 A059941 A059942
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Henry Bottomley (se16(AT)btinternet.com), Feb 14 2001
|
|
|
Search completed in 0.002 seconds
|
