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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A097386 Numbers n such that (largest digit of n)^(smallest digit of n) + n is prime. 2
 1, 10, 21, 30, 32, 40, 43, 60, 61, 65, 70, 81, 92, 100, 102, 106, 108, 130, 150, 152, 161, 172, 174, 180, 183, 185, 190, 210, 221, 232, 240, 250, 252, 270, 280, 283, 285, 292, 298, 306, 310, 322, 330, 354, 361, 372, 376, 381, 394, 400, 408, 420, 423, 430, 460 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS No term ends in 9. Conjecture: Let f(x)=(largest digit of x)^(smallest digit of x) + x. There are infinitely many positive integers n such that f(n) and f(n+1) are both prime; see A097387. LINKS EXAMPLE 1272 is in the sequence because 7^2 + 1272 = 1321, a prime. MATHEMATICA okQ[n_]:=Module[{idn=IntegerDigits[n]}, PrimeQ[Max[idn]^Min[idn]+n]] Select[Range[500], okQ] (* Harvey P. Dale, Dec 11 2010 *) CROSSREFS Cf. A054054, A054055, A097385, A097387. Sequence in context: A087598 A242287 A165403 * A108685 A108686 A078209 Adjacent sequences:  A097383 A097384 A097385 * A097387 A097388 A097389 KEYWORD base,easy,nonn AUTHOR Jason Earls, Aug 18 2004 EXTENSIONS Corrected by T. D. Noe, Oct 25 2006 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 June 30 03:34 EDT 2022. Contains 354913 sequences. (Running on oeis4.)