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

 

Logo
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. 38
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
FORMULA
Sum_{n>=1} (-1)^(n+1)/a(n) = Sum_{n>=1} (-1)^(n+1)/(2^n-1) = 0.76449978034844420919... . - Amiram Eldar, Feb 18 2024
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 *)
Flatten[Array[Table[#, CatalanNumber[#]]&, 7, 0]] (* Paolo Xausa, Feb 13 2024 *)
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
KEYWORD
nonn,base
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 4 23:24 EDT 2024. Contains 372257 sequences. (Running on oeis4.)