Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A062006
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A062006 Prime(n)^n + 1. +0
6
2, 3, 10, 126, 2402, 161052, 4826810, 410338674, 16983563042, 1801152661464, 420707233300202, 25408476896404832, 6582952005840035282, 925103102315013629322, 73885357344138503765450 (list; graph; listen)
OFFSET

0,1

COMMENT

(PARI) for(n=0,22,print(prime(n)^n+1))

REFERENCES

D. M. Burton, Elementary Number Theory, Allyn and Bacon, Inc. Boston, MA, 1976, pp. 56.

FORMULA

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

CROSSREFS

Equals A062457(n) + 1.

Sequence in context: A088222 A076927 A064647 this_sequence A119810 A055708 A132536

Adjacent sequences: A062003 A062004 A062005 this_sequence A062007 A062008 A062009

KEYWORD

easy,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Jun 27 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research