The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A208506 p^(p+1) + (p+1)^p, where p = prime(n). 2

%I #18 Nov 21 2013 12:50:22

%S 17,145,23401,7861953,3881436747409,4731091158953433,

%T 16248996011806421522977,42832853457545958193355601,

%U 535823088031930481975544151644865,81325936178163422902293018227199467668020601

%N p^(p+1) + (p+1)^p, where p = prime(n).

%C The definition has been the erroneous description of A104128 (as pointed out by H. P. Dale), prior to correction by R. J. Mathar on Feb 27 2012.

%C Sum of reciprocals rapidly converges to 0.065762941547548273299583...

%H Vincenzo Librandi, <a href="/A208506/b208506.txt">Table of n, a(n) for n = 1..70</a>

%t ok[n_] := n^(n+1)+(n+1)^n; Table[ok[n], {n, Prime[Range[10]]}] (* _Harvey P. Dale_, Feb 27 2012 *)

%o (PARI) A208506(n)=(1+n=prime(n))^n+n^(n+1)

%K nonn

%O 1,1

%A _M. F. Hasler_, Feb 27 2012

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.

Last modified February 29 10:50 EST 2024. Contains 370425 sequences. (Running on oeis4.)