This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A111905 A number n is included if more primes, among primes <= the largest prime dividing n, divide n than do not. 2
 2, 4, 6, 8, 10, 12, 15, 16, 18, 20, 24, 30, 32, 36, 40, 42, 45, 48, 50, 54, 60, 64, 66, 70, 72, 75, 80, 84, 90, 96, 100, 105, 108, 110, 120, 126, 128, 132, 135, 140, 144, 150, 154, 160, 162, 165, 168, 180, 192, 198, 200, 210, 216, 220, 225, 231, 240, 250, 252, 256, 264 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS EXAMPLE 20 is included because 5 is the largest prime dividing 20. And of the primes <= 5 (2,3,5), 2 and 5 (2 primes) divide 20, 3 (only 1 prime) does not divide 20. PROG (PARI) {m=270; v=vector(m); for(n=1, m, f=factor(n)[, 1]~; c=0; pc=0; forprime(p=2, vecmax(f), j=1; s=length(f); while(j<=s&&p!=f[j], j++); if(j<=s, c++); pc++); v[n]=sign(pc-2*c)); for(n=1, m, if(v[n]<0, print1(n, ", ")))} (Klaus Brockhaus) CROSSREFS Cf. A111906, A111907. Sequence in context: A058218 A264986 A140955 * A255385 A187412 A187473 Adjacent sequences:  A111902 A111903 A111904 * A111906 A111907 A111908 KEYWORD nonn AUTHOR Leroy Quet, Aug 19 2005 EXTENSIONS More terms from Klaus Brockhaus, Aug 21 2005 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 16 04:05 EST 2019. Contains 330013 sequences. (Running on oeis4.)