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.

A189344 Numbers with prime factorization pq^2r^2s^2.

This page as a plain text file.
%I A189344 #16 May 20 2017 10:48:51
%S A189344 6300,8820,9900,11700,14700,15300,17100,19404,20700,21780,22050,22932,
%T A189344 26100,27900,29988,30420,30492,33300,33516,36300,36900,38700,40572,
%U A189344 42300,42588,47700,50700,51156,52020,53100,53900,54450,54684,54900
%N A189344 Numbers with prime factorization pq^2r^2s^2.
%H A189344 T. D. Noe, <a href="/A189344/b189344.txt">Table of n, a(n) for n = 1..1000</a>
%H A189344 Will Nicholes, <a href="http://willnicholes.com/math/primesiglist.htm">Prime Signatures</a>
%H A189344 <a href="/index/Pri#prime_signature">Index to sequences related to prime signature</a>
%t A189344 f[n_]:=Sort[Last/@FactorInteger[n]]=={1,2,2,2}; Select[Range[90000],f]
%o A189344 (PARI) list(lim)=my(v=List(),t1,t2,t3); forprime(p=2,sqrtint(lim\180), t1=p^2; forprime(q=2,sqrtint(lim\(12*t1)), if(q==p, next); t2=q^2*t1; forprime(r=2,sqrtint(lim\(2*t2)), if(r==p || r==q, next); t3=r^2*t2; forprime(s=2,lim\t3, if(s==p || s==q || s==r, next); listput(v, t3*s))))); Set(v) \\ _Charles R Greathouse IV_, Aug 25 2016
%Y A189344 Cf. A179688, A179693, A179700.
%K A189344 nonn
%O A189344 1,1
%A A189344 _Vladimir Joseph Stephan Orlovsky_, May 09 2011