|
%I #30 May 22 2021 04:28:27
%S 1,2,4,6,8,12,16,24,32,36,48,64,96,120,128,144,192,240,256,288,384,
%T 480,512,576,720,768,864,960,1024,1152,1440,1536,1920,2048,2304,2880,
%U 3072,3456,3840,4096,4320,4608,5040,5760,6144,6912,7680,8192,8640,9216,10080
%N Numbers such that repeated division by their largest factorial divisor (as long as such a divisor larger than one exists) eventually yields 1.
%C Numbers whose closure under map x -> A076934(x) contains 1.
%C Largest factorial divisor of n is A000142(A055874(n)).
%C These numbers could be called "greedy Jordan-Polya numbers", as their presence in A001013 can be determined by a simple greedy algorithm.
%H David A. Corneth, <a href="/A344181/b344181.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Fa#factorial">Index entries for sequences related to factorial numbers</a>
%e 12 = 2^2 * 3 is present, as the largest factorial that divides 12 is A000142(3) = 6, and then 12/6 = 2 is also divisible by a factorial, and then 2/A000142(2) = 1.
%t fctdiv[n_] := Module[{m = 1, k = 1}, While[Divisible[n, m], k++; m *= k]; m /= k; n/m]; Select[Range[10^4], FixedPoint[fctdiv, #] == 1 &] (* _Amiram Eldar_, May 22 2021 *)
%Y Cf. A000142, A055874, A076934.
%Y Positions of ones in A093411.
%Y Subsequence of A001013. A344179 gives the terms not present here.
%Y Cf. also A025487 (analogous sequence for primorials).
%K nonn
%O 1,2
%A _Antti Karttunen_, May 18 2021
|
