%I #18 Mar 29 2022 15:10:39
%S 1,2,2,4,4,6,6,6,6,6,6,12,12,12,12,12,12,36,36,60,60,60,60,24,24,24,
%T 24,24,24,60,60,60,60,60,60,60,60,60,60,120,120,120,120,120,120,120,
%U 120,120,120,120,120,120,120,120,120,120,120,120,120,120,120,120,120,120
%N Smallest of the most frequently occurring numbers in 1-to-n multiplication table.
%H Branden Aldridge, <a href="/A057144/b057144.txt">Table of n, a(n) for n = 1..20000</a> (terms 1..1000 from Reinhard Zumkeller, terms 1001..10000 from Reinhard Zumkeller and Charles R Greathouse IV)
%H Benjamin Dickman, <a href="https://math.stackexchange.com/questions/776447/what-number-appears-most-often-in-an-n-times-n-multiplication-table">What number appears most often in an n X n multiplication table?</a>, Mathematics StackExchange, May 2014.
%e M(n) is the array in which m(x,y)= x*y for x = 1 to n and y = 1 to n. In m(10), the most frequently occurring numbers are 6, 8, 10, 12, 18, 20, 24, 30,40, each occurring 4 times. The smallest of these numbers is 6, so a(10) = 6.
%o (Haskell)
%o import Data.List (sort, group, sortBy, groupBy)
%o import Data.Function (on)
%o a057144 n = head $ last $ head $ groupBy ((==) `on` length) $
%o reverse $ sortBy (compare `on` length) $
%o group $ sort [u * v | u <- [1..n], v <- [1..n]]
%o -- _Reinhard Zumkeller_, Jun 22 2013
%o (PARI) T(n,f=factor(n))=my(k=#f~); f[,1]=primes(k+1)[2..k+1]~; f[1,1]=6; factorback(f)
%o listA025487(Nmax)=vecsort(concat(vector(logint(Nmax, 2), n, select(t->t<=Nmax, if(n>1, [factorback(primes(#p), Vecrev(p))|p<-partitions(n)], [1, 2])))))
%o ct(n,k)=sumdiv(n,d,max(d,n/d)<=k)
%o a(n)=if(n==1, return(1)); my(v=listA025487(n^2),r,t,at); for(i=1,#v, t=ct(v[i],n); if(t>r, r=t; at=v[i])); at \\ _Charles R Greathouse IV_, Feb 05 2022
%Y Cf. A057142, A057143, A057338.
%K nonn
%O 1,2
%A _Arran Fernandez_, Aug 13 2000
%E More terms from Larry Reeves (larryr(AT)acm.org), Apr 18 2001
|