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

%I #19 Sep 08 2022 08:46:14

%S 2,13,71,263,827,2377,6379,16603,41611,101573,243473,573637,1333613,

%T 3065983,6975971,15746347,35277211,78510373,173717329,382404863,

%U 837870343,1828047503,3973066781,8604768101,18576139177,39983413319

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

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

%F a(n) = A000040(A014480(n-1)). - _Michel Marcus_, Nov 23 2015

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

%o (Magma) [NthPrime(2^(n-1)*(2*n-1)): n in [1..20]]; // _Vincenzo Librandi_, Nov 23 2015

%o (PARI) a(n)=if(n<1,print1("Error n < 1"),prime(2^(n-1)*(2*n-1)) \\ _Anders Hellström_, Nov 23 2015

%o (Perl) use ntheory ":all"; say "$_ ",nth_prime(2**($_-1) * (2*$_-1)) for 1..50; # _Dana Jacobsen_, Apr 28 2017

%Y Cf. A000040, A014480, A264731 (main diagonal).

%K nonn

%O 1,1

%A _L. Edson Jeffery_, Nov 22 2015

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 18 04:56 EDT 2024. Contains 371767 sequences. (Running on oeis4.)