|
%I #22 Apr 16 2022 09:41:07
%S 1,3,6,9,9,15,15,21,24,24,24,36,36,36,48,51,51,57,57,75,75,75,75,90,
%T 90,90,90,90,90,114,114,114,114,114,126,138,138,138,138,156,156,180,
%U 180,180,198,198,198,207,207,207,207,207,207,207,207,237,237,237,237,267
%N Occurrences of most frequently occurring number in 1-to-n multiplication cube.
%H David A. Corneth, <a href="/A057338/b057338.txt">Table of n, a(n) for n = 1..10000</a> (first 250 terms from Reinhard Zumkeller, terms 251..500 from Branden Aldridge).
%e M(n) is the array in which m(x,y,z)=x*y*z for x = 1 to n, y = 1 to n and z = 1 to n. In M(7) the most frequently occurring numbers are 12 and 24. They occur 15 times, so a(7) = 15.
%o (Haskell)
%o import Data.List (group, sort)
%o a057338 n = head $ reverse $ sort $ map length $ group $
%o sort [u * v * w | u <- [1..n], v <- [1..n], w <- [1..n]]
%o -- _Reinhard Zumkeller_, Jun 22 2013
%Y Cf. A057142, A057339, A057340, A057341, A057344.
%K nonn,look
%O 1,2
%A _Neil Fernandez_, Aug 28 2000
%E More terms from _David W. Wilson_, Aug 28 2001
|
