|
Search: id:A113473
|
|
|
| A113473 |
|
n repeated 2^(n-1) times, see formulas. |
|
+0
1
|
|
| 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Or a(n)=floor(log(2, 2n)), n=1,2,...
It appears that a(n)=sum{k=0..n-1, (1-(-1)^A000108(k))/2}. Compare with A083058. - Paul Barry (pbarry(AT)wit.ie), Mar 31 2008
|
|
FORMULA
|
a(1)=1; for n>1 a(n) = a(floor(n/2)) + 1
|
|
MATHEMATICA
|
Two versions: with recurrency relation, a[1] = 1; a[n_]:= a[n] = a[Floor[n/2]] + 1; Table[a[n], {n, 200}] or with explicit formula, Table[Floor[Log[2, 2n]], {n, 100}]
|
|
CROSSREFS
|
Sequence in context: A075172 A029837 A070939 this_sequence A122027 A112751 A091194
Adjacent sequences: A113470 A113471 A113472 this_sequence A113474 A113475 A113476
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Zak Seidov (zakseidov(AT)yahoo.com), Jan 08 2006
|
|
|
Search completed in 0.002 seconds
|
