|
| |
|
|
A093476
|
|
Index of occurrence of the first 0-bit in binary representation of 3^n.
|
|
0
| |
|
|
2, 3, 2, 5, 2, 2, 3, 2, 4, 2, 2, 3, 2, 3, 2, 5, 2, 2, 3, 2, 4, 2, 2, 3, 2, 3, 2, 6, 2, 2, 3, 2, 4, 2, 2, 3, 2, 4, 2, 7, 2, 2, 3, 2, 5, 2, 2, 3, 2, 4, 2, 2, 3, 2, 3, 2, 5, 2, 2, 3, 2, 4, 2, 2, 3, 2, 3, 2, 5, 2, 2, 3, 2, 4, 2, 2, 3, 2, 3, 2, 6, 2, 2, 3, 2, 4, 2, 2, 3, 2, 4, 2, 7, 2, 2, 3, 2, 5, 2, 2, 3, 2, 4, 2, 2
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 2,1
|
|
|
FORMULA
| It seems that sum(i=2, n, a(i)) is asymptotic to c*n with c=2.7(8).....
|
|
|
EXAMPLE
| In binary 3^5=[1, 1, 1, 1, 0, 0, 1, 1] where the first 0 occurs at 5-th place. Hence a(5)=5.
|
|
|
PROG
| (PARI) a(n)=if(n<2, 0, s=1; while(component(binary(3^n), s)>0, s++); s)
|
|
|
CROSSREFS
| Cf. A011754.
Sequence in context: A124386 A098668 A112763 * A066727 A076606 A056927
Adjacent sequences: A093473 A093474 A093475 * A093477 A093478 A093479
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Benoit Cloitre (benoit7848c(AT)orange.fr), May 22 2004
|
| |
|
|
