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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A090525 Least number k such that floor[(n^n)/k] is prime, or 0 if no such number exists. 3
 2, 2, 11, 9, 11, 20, 10, 42, 13, 16, 57, 7, 35, 41, 53, 35, 171, 18, 141, 45, 19, 55, 212, 236, 94, 265, 13, 76, 26, 9, 13, 21, 160, 21, 21, 24, 378, 100, 66, 52, 75, 54, 214, 6, 678, 193, 137, 123, 138, 59, 605, 87, 165, 109, 417, 403, 100, 57, 778, 719, 79, 12, 83, 450 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 COMMENTS Conjecture: No term is zero. LINKS PROG (PARI) a(n)=for(i=1, 1000, if(isprime(floor((n^n)/i)), print1(i, ", "); break())) CROSSREFS Cf. A090526, A090527, A090528. Sequence in context: A213990 A275429 A222878 * A328455 A265530 A309477 Adjacent sequences:  A090522 A090523 A090524 * A090526 A090527 A090528 KEYWORD nonn AUTHOR Amarnath Murthy, Dec 07 2003 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 May 26 20:51 EDT 2022. Contains 354092 sequences. (Running on oeis4.)