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!)
A289898 a(n) = floor((2^prime(n+1))/Sum_{k=0|n,2^prime(k)}). 0

%I #30 Aug 03 2017 04:39:14

%S 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,

%T 12,3,12,15179,15,60,3,816,3,51,62,15,60,62,3,816,3,12,3,3226,4094,15,

%U 3,12,59,3,816,63,63,63,3,51,15,3,808,16363,15,3,12,15183

%N a(n) = floor((2^prime(n+1))/Sum_{k=0|n,2^prime(k)}).

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

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

%o (PARI) a(n) = 2^prime(n+1)\sum(k=1, n, 2^prime(k)); \\ _Michel Marcus_, Jul 16 2017

%Y Cf. A034785, A076793.

%K nonn

%O 1,1

%A _Joseph Wheat_, Jul 14 2017

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 September 1 12:47 EDT 2024. Contains 375591 sequences. (Running on oeis4.)