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!)
A152099 a(n) = (2^prime(n) - 1)*(2^prime(n) + 1) = 2^(2*prime(n)) - 1. 3

%I #19 Jun 26 2023 19:01:35

%S 15,63,1023,16383,4194303,67108863,17179869183,274877906943,

%T 70368744177663,288230376151711743,4611686018427387903,

%U 18889465931478580854783,4835703278458516698824703,77371252455336267181195263,19807040628566084398385987583

%N a(n) = (2^prime(n) - 1)*(2^prime(n) + 1) = 2^(2*prime(n)) - 1.

%C Idea resulted from seqfan posts by _Artur Jasinski_.

%F a(n) = A001348(n) * A098640(n).

%F a(n) = A034785(n)^2 - 1.

%F a(n) = A000302(A000040(n)) - 1.

%t Table[(2^Prime[n] - 1)*(2^Prime[n] + 1), {n, 1, 20}]

%o (Python)

%o from sympy import prime

%o def A152099(n): return (1<<(prime(n)<<1))-1 # _Chai Wah Wu_, Jun 26 2023

%Y Cf. A000040, A000302, A001348, A034785, A098640.

%K nonn

%O 1,1

%A _Roger L. Bagula_, Nov 24 2008

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 April 19 14:10 EDT 2024. Contains 371792 sequences. (Running on oeis4.)