This site is supported by donations to The OEIS Foundation.

 Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS". Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A113473 n repeated 2^(n-1) times, see formulas. 3
 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; text; 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, Mar 31 2008 LINKS FORMULA a(1)=1; for n>1 a(n) = a(floor(n/2)) + 1 a(n)=A070939(n). [From R. J. Mathar, 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 * A265370 A238407 A196050 Adjacent sequences:  A113470 A113471 A113472 * A113474 A113475 A113476 KEYWORD nonn,easy AUTHOR Zak Seidov, Jan 08 2006 EXTENSIONS Typo in Mathematica program fixed by Zak Seidov, Dec 09 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 23 20:23 EST 2017. Contains 295141 sequences.