|
| |
|
|
A113473
|
|
n repeated 2^(n-1) times, see formulas.
|
|
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; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| 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
a(n)=A070939(n). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 13 2008]
|
|
|
MATHEMATICA
| Two versions: with recurrence 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}]
|
|
|
PROG
| (PARI) for(n=1, 9, for(i=1, 1<<(n-1), print1(n", "))) \\ Charles R Greathouse IV, Jun 11 2011
|
|
|
CROSSREFS
| Equals half of A191682.
Sequence in context: A004258 A029837 A070939 * A196050 A122027 A112751
Adjacent sequences: A113470 A113471 A113472 * A113474 A113475 A113476
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Zak Seidov (zakseidov(AT)yahoo.com), Jan 08 2006
|
|
|
EXTENSIONS
| Typo in Mathematica program fixed by Zak Seidov (zakseidov(AT)yahoo.com), Dec 09 2009
|
| |
|
|
