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!)
A104128 a(n) = p + p^(p+1), where p = prime(n). 3

%I #34 Oct 30 2023 09:53:08

%S 10,84,15630,5764808,3138428376732,3937376385699302,

%T 14063084452067724991026,37589973457545958193355620,

%U 480250763996501976790165756943064,74462898441675122902293018227199467668020630,529144398052420314716929933900838757437386767392

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

%C Sum of reciprocals rapidly converges to 0.11196891489794721930017828981362..

%H Ray Chandler, <a href="/A104128/b104128.txt">Table of n, a(n) for n = 1..76</a>

%F a(n) = A000040(n) + A104126(n).

%t Table[p + p^(p+1), {p, Prime[Range[12]]}] (* _Robert G. Wilson v_, Feb 27 2012 *)

%o (Maxima) A104128(n) := block(

%o return(A000040(n)^(1+A000040(n))+A000040(n))

%o )$ /* _R. J. Mathar_, Feb 27 2012 */

%o (PARI) A104128(n)=(n=prime(n))+n^(n+1) \\ _M. F. Hasler_, Feb 26 2012

%K easy,nonn

%O 1,1

%A _Cino Hilliard_, Mar 06 2005

%E Definition corrected and incorrect program removed by _R. J. Mathar_, Feb 27 2012

%E More terms from _Harvey P. Dale_, 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 29 15:45 EDT 2024. Contains 372114 sequences. (Running on oeis4.)