Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078201
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A078201 a(n) = smallest prime of the form n^k + k^n, or 0 if no such prime exists. +0
2
2, 3, 17, 5, 59604644783353249, 7, 4318114567396436564035293097707729426477458833, 205688069665150755269371147819668813122841983204711281293004769, 593, 11 (list; graph; listen)
OFFSET

1,1

COMMENT

If p is a prime then a(p-1) = p, with k = 1.

EXAMPLE

a(3) = 3^2 + 2^3 = 17, a(4) = 5 = 4^1 + 1^4.

CROSSREFS

Sequence in context: A029913 A029914 A073125 this_sequence A090913 A135931 A051074

Adjacent sequences: A078198 A078199 A078200 this_sequence A078202 A078203 A078204

KEYWORD

hard,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Nov 21 2002

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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research