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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A062006 a(n) = prime(n)^n + 1. 7
 3, 10, 126, 2402, 161052, 4826810, 410338674, 16983563042, 1801152661464, 420707233300202, 25408476896404832, 6582952005840035282, 925103102315013629322, 73885357344138503765450, 12063348350820368238715344, 3876269050118516845397872322 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Sum of the n-th powers of the divisors of the n-th prime. - Wesley Ivan Hurt, Jan 17 2016 REFERENCES D. M. Burton, Elementary Number Theory, Allyn and Bacon, Inc. Boston, MA, 1976, pp. 56. LINKS Harry J. Smith, Table of n, a(n) for n = 1..100 FORMULA a(n) = prime(n)^n + 1. MAPLE A062006:=n->ithprime(n)^n+1: seq(A062006(n), n=1..20); # Wesley Ivan Hurt, Jan 18 2016 MATHEMATICA Table[Prime[n]^n + 1, {n, 20}] (* Harvey P. Dale, Dec 23 2013 *) PROG (PARI) for(n=1, 22, print1(prime(n)^n+1, ", ")) (PARI) for (n=1, 100, a=2, a=prime(n)^n + 1; write("b062006.txt", n, " ", a) ) \\ Harry J. Smith, Jul 29 2009 (Magma) [NthPrime(n)^n+1 : n in [1..20]]; // Vincenzo Librandi, Jun 24 2015 CROSSREFS Equals A062457(n) + 1. Sequence in context: A242473 A282410 A290059 * A199036 A173415 A199232 Adjacent sequences: A062003 A062004 A062005 * A062007 A062008 A062009 KEYWORD easy,nonn AUTHOR Jason Earls, Jun 27 2001 STATUS approved

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 December 6 03:07 EST 2023. Contains 367594 sequences. (Running on oeis4.)