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.

A190320 Numbers with prime factorization pq^2r^3s^3.

This page as a plain text file.
%I A190320 #9 Aug 25 2016 23:07:02
%S A190320 37800,52920,59400,63000,70200,91800,94500,99000,102600,116424,117000,
%T A190320 123480,124200,130680,137592,147000,148500,153000,156600,167400,
%U A190320 171000,175500,179928,182520,182952,185220,199800,201096,205800,207000,221400
%N A190320 Numbers with prime factorization pq^2r^3s^3.
%H A190320 T. D. Noe, <a href="/A190320/b190320.txt">Table of n, a(n) for n = 1..1000</a>
%H A190320 Will Nicholes,<a href="http://willnicholes.com/math/primesiglist.htm">Prime Signatures</a>
%t A190320 f[n_]:=Sort[Last/@FactorInteger[n]]=={1,2,3,3};Select[Range[350000],f]
%o A190320 (PARI) list(lim)=my(v=List(),t1,t2,t3); forprime(p=2,sqrtnint(lim\360, 3), t1=p^3; forprime(q=2,sqrtnint(lim\(12*t1), 3), if(q==p, next); t2=q^3*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 A190320 Cf. A190294, A190319.
%K A190320 nonn
%O A190320 1,1
%A A190320 _Vladimir Joseph Stephan Orlovsky_, May 08 2011