Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064052
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A064052
%S A064052 2,3,5,6,7,10,11,13,14,15,17,19,20,21,22,23,26,28,29,31,33,34,35,37,
%T A064052 38,39,41,42,43,44,46,47,51,52,53,55,57,58,59,61,62,65,66,67,68,69,71,
%U A064052 73,74,76,77,78,79,82,83,85,86,87,88,89,91,92,93,94,95,97,99,101,102
%N A064052 Not sqrt(n)-smooth: some prime factor of n is > sqrt(n).
%C A064052 This set (S say) has density d(S) = Log(2) - Benoit Cloitre (benoit7848c(AT)orange.fr), 
               Jun 12 2002
%H A064052 Harry J. Smith, <a href="b064052.txt">Table of n, a(n) for n=1,...,1000</
               a>
%H A064052 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/
               GreatestPrimeFactor.html">Greatest Prime Factor</a>
%o A064052 (PARI) { n=0; for (m=2, 10^9, f=factor(m)~; if (f[1, length(f)]^2 > m, 
               write("b064052.txt", n++, " ", m); if (n==1000, break)) ) } [From 
               Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 06 2009]
%Y A064052 Cf. A048098, A063538, A063539.
%Y A064052 Sequence in context: A119024 A048839 A122144 this_sequence A064594 A076144 
               A005117
%Y A064052 Adjacent sequences: A064049 A064050 A064051 this_sequence A064053 A064054 
               A064055
%K A064052 nonn,easy
%O A064052 1,1
%A A064052 Dean Hickerson (dean.hickerson(AT)yahoo.com), Aug 28 2001

    
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 4 15:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research