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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A299404 a(n) = 1 + Sum_{m >= 1} (m + 1)^n/2^(m - 1). 0
3, 7, 23, 103, 599, 4327, 37463, 378343, 4366679, 56698087, 817980503, 12981060583, 224732540759, 4214866787047, 85130743763543, 1842265527822823, 42525237455850839, 1042966136233087207, 27084277306054762583, 742412698554627289063, 21421502369955073624919 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Table of n, a(n) for n=0..20.

FORMULA

a(n + 1) = 4*A162509(n + 1) + a(n).

a(n) = 2*A007047(n) + 1.

{a(4n - 3), a(4n - 2), a(4n - 1), a(4n)} mod 10 = {7, 3, 3, 9} for n > 0.

floor(log_2(a(n))) = A083652(n).

Lim_{n->inf} (a(n)^(1/n))/n = 1/(e*log(2)). - Jon E. Schoenfield, Feb 24 2018

a(n)/n! ~ 4 / (log(2))^(n+1). - Vaclav Kotesovec, Apr 17 2018

MATHEMATICA

Table[1 + LerchPhi[1/2, -n, 2], {n, 0, 20}] (* Vaclav Kotesovec, Apr 17 2018 *)

PROG

(PARI) a(n) = 1+ round(suminf(m=1, (m + 1)^n/2^(m - 1)));

CROSSREFS

Cf. A007047, A083652, A162509.

Sequence in context: A100964 A080077 A096318 * A268140 A133788 A120271

Adjacent sequences:  A299401 A299402 A299403 * A299405 A299406 A299407

KEYWORD

nonn

AUTHOR

Joseph Wheat, Feb 20 2018

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 January 22 04:27 EST 2020. Contains 331133 sequences. (Running on oeis4.)