The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A072643 Half of the binary width of the terms of A014486, the number of digits in A063171(n)/2. 32
 0, 1, 2, 2, 3, 3, 3, 3, 3, 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, 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, 6, 6, 6, 6, 6, 6, 6, 6 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Table of n, a(n) for n=0..104. MATHEMATICA a[n_] := Module[{i, c, a}, i = c = 0; a = 1; While[n>c, a *= (4*i+2)/(i+2); i++; c += a]; i]; Table[a[n], {n, 0, 104}] (* Jean-François Alcover, Dec 26 2017, from Sage code *) PROG (Sage) def A072643(n) : i = c = 0; a = 1 while n > c : a *= (4*i+2)/(2+i) i += 1; c += a return i [A072643(n) for n in (0..100)] # Peter Luschny, Sep 07 2012 CROSSREFS Each value v occurs A000108(v) times. The maximum position for value v to occur is A014138(v). Permutations: A071673, A072644, A072645, A072660. Cf. also A002024, A072649. Sequence in context: A084320 A161358 A120699 * A130260 A276621 A111393 Adjacent sequences: A072640 A072641 A072642 * A072644 A072645 A072646 KEYWORD nonn AUTHOR Antti Karttunen, Jun 02 2002 STATUS approved

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

Last modified September 26 04:23 EDT 2023. Contains 365652 sequences. (Running on oeis4.)