Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A090525
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A090525
%S A090525 2,2,11,9,11,20,10,42,13,16,57,7,35,41,53,35,171,18,141,45,19,55,212,
%T A090525 236,94,265,13,76,26,9,13,21,160,21,21,24,378,100,66,52,75,54,214,6,678,
%U A090525 193,137,123,138,59,605,87,165,109,417,403,100,57,778,719,79,12,83,450
%N A090525 Least number k such that floor[(n^n)/k] is prime, or 0 if no such number 
               exists.
%C A090525 Conjecture: No term is zero.
%o A090525 (PARI) a(n)=for(i=1,1000,if(isprime(floor((n^n)/i)),print1(i,",");break()))
%Y A090525 Cf. A090526, A090527, A090528.
%Y A090525 Sequence in context: A027623 A037234 A141651 this_sequence A126806 A121871 
               A151365
%Y A090525 Adjacent sequences: A090522 A090523 A090524 this_sequence A090526 A090527 
               A090528
%K A090525 nonn
%O A090525 2,1
%A A090525 Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Dec 07 2003

    
page 1

Search completed in 0.001 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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research