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

%I #19 Dec 15 2017 17:34:58

%S 17,37,101,197,485,677,1157,1445,2117,3365,3845,5477,6725,7397,8837,

%T 11237,13925,14885,17957,20165,21317,24965,27557,31685,37637,40805,

%U 42437,45797,47525,51077,64517,68645,75077,77285,88805

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

%H Harry J. Smith, <a href="/A060429/b060429.txt">Table of n, a(n) for n = 1..100</a>

%F a(n) = 4*A001248(n) + 1. - _Vincenzo Librandi_, Dec 17 2013

%p A060429:=n->4*ithprime(n)^2+1; seq(A060429(n), n=1..100); # _Wesley Ivan Hurt_, Dec 17 2013

%t Table[4*Prime[n]^2+1, {n, 100}] (* _Wesley Ivan Hurt_, Dec 17 2013 *)

%o (PARI) { n=0; forprime (p=1, 542, write("b060429.txt", n++, " ", 4*p^2 + 1); ) } \\ _Harry J. Smith_, Jul 05 2009

%Y Cf. A001248, A052291, A052292.

%K nonn,easy

%O 1,1

%A _Jason Earls_, Apr 06 2001

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 23 07:34 EDT 2024. Contains 371905 sequences. (Running on oeis4.)