Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A111906
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A111906 A number n is included if fewer primes, among primes <= the largest prime dividing n, divide n than do not. +0
3
5, 7, 11, 13, 17, 19, 22, 23, 25, 26, 29, 31, 33, 34, 37, 38, 39, 41, 43, 44, 46, 47, 49, 51, 52, 53, 55, 57, 58, 59, 61, 62, 65, 67, 68, 69, 71, 73, 74, 76, 77, 79, 82, 83, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 97, 99, 101, 102, 103, 104, 106, 107, 109, 111, 113, 114, 115 (list; graph; listen)
OFFSET

1,1

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

EXAMPLE

22 is included because 11 is the largest prime dividing 22. And of the primes <= 11 (2,3,5,7,11), 2 and 11 (2 primes) divide 22, but 3 and 5 and 7 (3 primes) do not divide 22.

PROGRAM

(PARI) {m=115; 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. A111905, A111907.

Sequence in context: A079498 A035035 A113909 this_sequence A101550 A136801 A106571

Adjacent sequences: A111903 A111904 A111905 this_sequence A111907 A111908 A111909

KEYWORD

nonn

AUTHOR

Leroy Quet Aug 19 2005

EXTENSIONS

More terms from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Aug 21 2005

page 1

Search completed in 0.002 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 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research