cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A208506 #18 Nov 21 2013 12:50:22
%S A208506 17,145,23401,7861953,3881436747409,4731091158953433,
%T A208506 16248996011806421522977,42832853457545958193355601,
%U A208506 535823088031930481975544151644865,81325936178163422902293018227199467668020601
%N A208506 p^(p+1) + (p+1)^p, where p = prime(n).
%C A208506 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 A208506 Sum of reciprocals rapidly converges to 0.065762941547548273299583...
%H A208506 Vincenzo Librandi, <a href="/A208506/b208506.txt">Table of n, a(n) for n = 1..70</a>
%t A208506 ok[n_] := n^(n+1)+(n+1)^n; Table[ok[n], {n, Prime[Range[10]]}] (* _Harvey P. Dale_, Feb 27 2012 *)
%o A208506 (PARI) A208506(n)=(1+n=prime(n))^n+n^(n+1)
%K A208506 nonn
%O A208506 1,1
%A A208506 _M. F. Hasler_, Feb 27 2012