login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A235333 a(n) is the smallest k such that Sum_{i=0..k} 1/A001316(i) >= n. 0
0, 2, 5, 9, 14, 18, 24, 32, 37, 45, 56, 65, 70, 80, 90, 102, 122, 130, 136, 146, 160, 171, 192, 205, 228, 256, 260, 268, 279, 292, 308, 324, 343, 372, 391, 411, 444, 480, 513, 518, 528, 537, 550, 569, 584, 605, 640, 649, 672, 705, 744, 773, 792, 823, 858, 904 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Note that A001316(n) = Sum_{k=0..n} mod(C(n,k),2).

Therefore, the infinite series Sum_{n>=0} 1/A001316(n) is a special case of Sum_{n>=0} 1/Sum_{k=0..n} ((mod(C(n,k),2)*x^k) for x=1 (cf. A001317, A100307, A100308, etc.). For x>1 this series is convergent, while for x=1 it is divergent. It would be interesting to have asymptotic estimates for a(n).

LINKS

Table of n, a(n) for n=1..56.

MATHEMATICA

a[n_] := Module[{k=0, s=1}, While[s < n, k++; s += (1/Numerator[2^k / k!])] ; k]; Array[a, 60] (* Amiram Eldar, Dec 04 2018 *)

PROG

(PARI) f(n) = numerator(2^n / n!); \\ A001316

a(n) = my(k=0, s=1/f(0)); while (s < n, k++; s += 1/f(k)); k; \\ Michel Marcus, Dec 04 2018

CROSSREFS

Cf. A001316, A000120.

Sequence in context: A070986 A074793 A161767 * A060139 A266899 A112265

Adjacent sequences:  A235330 A235331 A235332 * A235334 A235335 A235336

KEYWORD

nonn

AUTHOR

Vladimir Shevelev, Jan 06 2014

EXTENSIONS

More terms from Peter J. C. Moses, Jan 06 2014

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 6 18:59 EDT 2020. Contains 334832 sequences. (Running on oeis4.)