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.

A071366 Numbers n such that A046523(n) <> A071364(n) and A071364(n) <> n.

This page as a plain text file.
%I A071366 #9 Jul 07 2015 11:08:41
%S A071366 50,75,98,126,147,198,234,242,245,250,294,306,338,342,350,363,375,378,
%T A071366 414,490,500,507,522,525,550,558,578,588,594,605,650,666,686,702,722,
%U A071366 726,735,738,756,774,825,845,846,847,850,867,882,918,950,954,975,980
%N A071366 Numbers n such that A046523(n) <> A071364(n) and A071364(n) <> n.
%C A071366 Also A046523(n) <> n, as A046523(n) <= A071364(n) <= n.
%e A071366 n=50=2*5*5: A071364(50)=2*3*3=18, A046523(50)=2*2*3=12;
%e A071366 n=500=2*2*5*5*5: A071364(500)=2*2*3*3*3=108, A046523(500)=2*2*2*3*3=72.
%t A071366 Select[Range[1000], (e = Last /@ FactorInteger[ # ]) != Sort[e, Greater] && Product[Prime[i]^e[[i]], {i, Length[e]}] != # &] (* _Ray Chandler_, Sep 23 2005 *)
%Y A071366 Cf. A071365.
%K A071366 nonn
%O A071366 1,1
%A A071366 _Reinhard Zumkeller_, May 21 2002
%E A071366 Extended by _Ray Chandler_, Sep 23 2005