login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A146166 Odd squarefree semiprimes. 12
15, 21, 33, 35, 39, 51, 55, 57, 65, 69, 77, 85, 87, 91, 93, 95, 111, 115, 119, 123, 129, 133, 141, 143, 145, 155, 159, 161, 177, 183, 185, 187, 201, 203, 205, 209, 213, 215, 217, 219, 221, 235, 237, 247, 249, 253, 259, 265, 267, 287, 291 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Subsequence of A056913. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 29 2008]

These numbers n have the property that n is a Fermat pseudoprime for at least two bases 1 < b < n - 1. That is, b^(n - 1) = 1 (mod n). See sequence A175101 for a count of the number of bases.

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

MATHEMATICA

max = 300; A146166 = Sort@Flatten@Table[Prime[m] Prime[n], {n, 3, Ceiling[PrimePi[max/3]]}, {m, 2, n - 1}]; Select[A146166, # < max &] (* From Alonso del Arte based on Robert G. Wilson v's program for A006881, Oct 24 2011 *)

CROSSREFS

Cf. A001358 (semiprimes), A046388 (odd numbers with exactly 2 distinct prime factors).

Sequence in context: A046388 A098905 A024556 * A056913 A002557 A128907

Adjacent sequences:  A146163 A146164 A146165 * A146167 A146168 A146169

KEYWORD

nonn

AUTHOR

W. Bomfim (webonfim(AT)bol.com.br), Oct 27 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 23:53 EST 2012. Contains 205689 sequences.