cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A323350 Nonprime numbers > 1 whose number of prime factors counted with multiplicity is a perfect square.

This page as a plain text file.
%I A323350 #12 Jan 15 2019 12:13:06
%S A323350 16,24,36,40,54,56,60,81,84,88,90,100,104,126,132,135,136,140,150,152,
%T A323350 156,184,189,196,198,204,210,220,225,228,232,234,248,250,260,276,294,
%U A323350 296,297,306,308,315,328,330,340,342,344,348,350,351,364,372,375,376
%N A323350 Nonprime numbers > 1 whose number of prime factors counted with multiplicity is a perfect square.
%C A323350 First differs from A014613 in having 512.
%H A323350 Robert Israel, <a href="/A323350/b323350.txt">Table of n, a(n) for n = 1..10000</a>
%e A323350 360 = 2*2*2*3*3*5 has 6 prime factors, and 6 is not a perfect square, so 360 does not belong to the sequence.
%e A323350 2160 = 2*2*2*2*3*3*3*5 has 8 prime factors, and 8 is not a perfect square, so 2160 does not belong to the sequence.
%e A323350 10800 = 2*2*2*2*3*3*3*5*5 has 9 prime factors, and 9 is a perfect square, so 10800 belongs to the sequence.
%p A323350 filter:= proc(n) local t;
%p A323350   t:= numtheory:-bigomega(n);
%p A323350   t > 1 and issqr(t)
%p A323350 end proc:
%p A323350 select(filter, [$4..1000]); # _Robert Israel_, Jan 15 2019
%t A323350 Select[Range[100],#>1&&!PrimeQ[#]&&IntegerQ[Sqrt[PrimeOmega[#]]]&]
%o A323350 (PARI) isok(n) = (n>1) && !isprime(n) && issquare(bigomega(n)); \\ _Michel Marcus_, Jan 15 2019
%Y A323350 Cf. A000005, A001222, A063989, A067028, A067340, A070175, A071625, A118914, A167175, A323305.
%K A323350 nonn
%O A323350 1,1
%A A323350 _Gus Wiseman_, Jan 15 2019