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

%I #10 Sep 08 2022 08:45:28

%S 5,28,3126,823544,285311670612,302875106592254,827240261886336764178,

%T 1978419655660313589123980,20880467999847912034355032910568,

%U 2567686153161211134561828214731016126483470,17069174130723235958610643029059314756044734432,10555134955777783414078330085995832946127396083370199442518

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

%H Vincenzo Librandi, <a href="/A125137/b125137.txt">Table of n, a(n) for n = 1..77</a>

%F a(n) = A051674(n)+1. - _R. J. Mathar_, Apr 23 2007

%t Table[Prime[n]^Prime[n] + 1, {n , 20}] (* _Vincenzo Librandi_, Mar 27 2014 *)

%o (Magma) [p^p+1: p in PrimesUpTo(40)]; // _Vincenzo Librandi_, Mar 27 2014

%Y See A125136 for factorizations. Cf. A088730, A125135.

%Y Cf. A104131, A114846.

%K nonn

%O 1,1

%A _N. J. A. Sloane_, Jan 21 2007

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 25 08:27 EDT 2024. Contains 371964 sequences. (Running on oeis4.)