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.

A062006 a(n) = prime(n)^n + 1.

This page as a plain text file.
%I A062006 #49 Sep 08 2022 08:45:03
%S A062006 3,10,126,2402,161052,4826810,410338674,16983563042,1801152661464,
%T A062006 420707233300202,25408476896404832,6582952005840035282,
%U A062006 925103102315013629322,73885357344138503765450,12063348350820368238715344,3876269050118516845397872322
%N A062006 a(n) = prime(n)^n + 1.
%C A062006 Sum of the n-th powers of the divisors of the n-th prime. - _Wesley Ivan Hurt_, Jan 17 2016
%D A062006 D. M. Burton, Elementary Number Theory, Allyn and Bacon, Inc. Boston, MA, 1976, pp. 56.
%H A062006 Harry J. Smith, <a href="/A062006/b062006.txt">Table of n, a(n) for n = 1..100</a>
%F A062006 a(n) = prime(n)^n + 1.
%p A062006 A062006:=n->ithprime(n)^n+1: seq(A062006(n), n=1..20); # _Wesley Ivan Hurt_, Jan 18 2016
%t A062006 Table[Prime[n]^n + 1, {n, 20}] (* _Harvey P. Dale_, Dec 23 2013 *)
%o A062006 (PARI) for(n=1,22,print1(prime(n)^n+1, ", "))
%o A062006 (PARI) for (n=1, 100, a=2, a=prime(n)^n + 1; write("b062006.txt", n, " ", a) ) \\ _Harry J. Smith_, Jul 29 2009
%o A062006 (Magma) [NthPrime(n)^n+1 : n in [1..20]]; // _Vincenzo Librandi_, Jun 24 2015
%Y A062006 Equals A062457(n) + 1.
%K A062006 easy,nonn
%O A062006 1,1
%A A062006 _Jason Earls_, Jun 27 2001