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!)
A141086 a(n) = prime(2*n^2) - 2*n^2. 0

%I #11 Mar 08 2019 03:30:16

%S 1,11,43,99,179,287,423,591,791,1023,1289,1589,1935,2301,2731,3159,

%T 3641,4165,4749,5333,5975,6653,7403,8159,8927,9809,10739,11609,12659,

%U 13601,14697,15815,17033,18167,19391,20635,22011,23379,24809,26243,27831

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

%F a(n) = A014689(A001105(n)). - _Michel Marcus_, Mar 08 2019

%e a(1) = prime(2*1^2) - 2*1^2 = prime(2) - 2 = 3 - 2 = 1.

%e a(2) = prime(2*2^2) - 2*2^2 = prime(8) - 8 = 19 - 8 = 11.

%p a:=proc(n) options operator, arrow: ithprime(2*n^2)-2*n^2 end proc: seq(a(n), n=1..45); # _Emeric Deutsch_, Aug 07 2008

%t Prime[#]-#&/@(2*Range[50]^2) (* _Harvey P. Dale_, May 04 2016 *)

%o (PARI) a(n) = my(m = 2*n^2); prime(m) - m; \\ _Michel Marcus_, Mar 08 2019

%Y Cf. A001105 (2*n^2), A014689 (prime(n) - n).

%K nonn

%O 1,2

%A _Juri-Stepan Gerasimov_, Jul 31 2008

%E Corrected and extended by _Emeric Deutsch_, Aug 07 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 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)