Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A141711
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A141711 Carmichael numbers with more than 3 prime factors. +0
1
41041, 62745, 63973, 75361, 101101, 126217, 172081, 188461, 278545, 340561, 449065, 552721, 656601, 658801, 670033, 748657, 825265, 838201, 852841, 997633, 1033669, 1050985, 1082809, 1569457, 1773289, 2100901, 2113921, 2433601 (list; graph; listen)
OFFSET

1,1

COMMENT

Sequence A087788 gives Carmichael numbers with exactly 3 prime factors; since they cannot have less (cf. references in A002997), this sequence is the complement of A087788 in A002997.

FORMULA

A141711 = A002997 \ A087788 = A074379 U A112428 U A112429 U A112430 U A112431 U A112432 U ...

EXAMPLE

a(17)=825265 is the least Carmichael number having more than 4 divisors, thus the sequence differs from A074379 only from that term on.

PROGRAM

(PARI) A2997=readvec("b002997.gp"); A002997(n)=A2997[n]; for( n=1, 100, omega( A002997(n) ) > 3 & print1( A002997(n)", "))

CROSSREFS

Cf. A002997, A087788, A074379, A112428-A112432, A006931.

Sequence in context: A133863 A033532 A047828 this_sequence A074379 A027577 A128150

Adjacent sequences: A141708 A141709 A141710 this_sequence A141712 A141713 A141714

KEYWORD

nonn

AUTHOR

M. F. Hasler (Maximilian.Hasler(AT)gmail.com), Jul 01 2008

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 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research