|
%I #41 Feb 09 2019 11:11:33
%S 3,8,24,48,120,288,360,840,1680,5040,11880,32760,143640,201600,491400,
%T 776160,2042040,3500640,7447440,9480240,17297280,34234200,143256960,
%U 514337040,555120720,569729160,1656408600,4283571600,8148853440,10951831800,35415099720,51437786400
%N Numbers of the form p^2-1 that have a record-breaking number of divisors, where p is prime.
%C a(11)-a(26) from Chuck Gaydos.
%H Chai Wah Wu, <a href="/A323278/b323278.txt">Table of n, a(n) for n = 1..63</a>
%H Chris Caldwell and G. L. Honaker, Jr., <a href="https://primes.utm.edu/curios/page.php?short=23869">Prime Curio for 23869</a>
%e a(7) = 360 because 360 has a record-breaking 24 divisors and 360 = p^2-1, where p = 19 is prime.
%t Block[{s = Prime[Range[10^5]]^2 - 1, t}, t = DivisorSigma[0, s]; Map[s[[FirstPosition[t, #][[1]] ]] &, Union@ FoldList[Max, t]]] (* _Michael De Vlieger_, Jan 19 2019 *)
%o (PARI) lista(nn) = {my(m = 0, p = 2, np); for (n=1, nn, np = p^2-1; if (((nd = numdiv(np)) > m), print1(np, ", "); m = nd); p = nextprime(p+1););} \\ _Michel Marcus_, Jan 12 2019
%o (Python)
%o from sympy import divisor_count, nextprime
%o A323278_list, p, nmax = [], 2 , -1
%o while len(A323278_list) < 100:
%o n = divisor_count(p**2-1)
%o if n > nmax:
%o nmax = n
%o A323278_list.append(p**2-1)
%o p = nextprime(p) # _Chai Wah Wu_, Feb 09 2019
%Y Cf. A000005, A084920.
%K nonn
%O 1,1
%A _G. L. Honaker, Jr._, Jan 11 2019
%E a(27)-a(32) from _Daniel Suteu_, Jan 12 2019
|
