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!)
A289898 a(n) = floor((2^prime(n+1))/Sum_{k=0|n,2^prime(k)}). 0
2, 2, 2, 11, 3, 12, 3, 12, 59, 3, 51, 15, 3, 12, 59, 62, 3, 51, 15, 3, 50, 15, 60, 251, 15, 3, 12, 3, 12, 15179, 15, 60, 3, 816, 3, 51, 62, 15, 60, 62, 3, 816, 3, 12, 3, 3226, 4094, 15, 3, 12, 59, 3, 816, 63, 63, 63, 3, 51, 15, 3, 808, 16363, 15, 3, 12, 15183 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

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

FORMULA

a(n) = floor(2^prime(n+1)/(Sum_{k=1..n} 2^prime(k))).

MATHEMATICA

Table[Floor[2^Prime[n + 1]/Sum[ 2^Prime[k], {k, n}]], {n, 66}] (* Michael De Vlieger, Jul 16 2017 *)

PROG

(PARI) a(n) = 2^prime(n+1)\sum(k=1, n, 2^prime(k)); \\ Michel Marcus, Jul 16 2017

CROSSREFS

Cf. A034785, A076793.

Sequence in context: A263060 A089871 A236046 * A068971 A019233 A121223

Adjacent sequences:  A289895 A289896 A289897 * A289899 A289900 A289901

KEYWORD

nonn

AUTHOR

Joseph Wheat, Jul 14 2017

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 August 8 23:02 EDT 2020. Contains 336300 sequences. (Running on oeis4.)