A036116 Numbers n such that the number of distinct primes dividing n is a square.

1, 2, 3, 4, 5, 7, 8, 9, 11, 13, 16, 17, 19, 23, 25, 27, 29, 31, 32, 37, 41, 43, 47, 49, 53, 59, 61, 64, 67, 71, 73, 79, 81, 83, 89, 97, 101, 103, 107, 109, 113, 121, 125, 127, 128, 131, 137, 139, 149, 151, 157, 163, 167, 169, 173, 179, 181, 191, 193, 197, 199, 210, 211, 223, 227, 229, 233, 239, 241, 243, 251, 256, 257, 263, 269, 271, 277, 281

Offset

1,2

Links

Enrique Pérez Herrero, Table of n, a(n) for n = 1..5000

Example

8 = 2^3 is divisible by just one (distinct) prime, 2 and 1 is a square, so 8 is in the sequence.

Maple

readlib(issqr): with(numtheory): select(x->issqr(nops(factorset(x))), [ seq(n, n=1..300) ]);

Mathematica

Select[Range[100], IntegerQ[PrimeNu[#]^(1/2)]&] (* Enrique Pérez Herrero, Jul 07 2012 *)

Prog

(PARI) is(n)=issquare(omega(n)) \\ Charles R Greathouse IV, Mar 19 2013

Crossrefs

Differs from A000961 at a(62) = 210, etc.

Sequence in context: A329366 A144711 A337935 * A246655 A000961 A128603

Adjacent sequences: A036113 A036114 A036115 * A036117 A036118 A036119

Keyword

nonn,easy

Author

N. J. A. Sloane.

Status

approved