|
%I M2515 #44 Mar 27 2024 08:24:30
%S 3,6,7,7,23,62,143,44,159,46,47,174,2239,239,719,241,5849,2098,2099,
%T 43196,14871,19574,35423,193049,2105,36287,1119,284,240479,58782,
%U 341087,371942,6459,69614,37619,152188,152189,487343,767919,85741,3017321
%N Erdős-Selfridge function: a(n) is the least number m > n+1 such that the least prime factor of binomial(m, n) is > n.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Jonathan Webster, <a href="/A003458/b003458.txt">Table of n, a(n) for n = 1..375</a> (terms 1..200 from H. C. Williams)
%H E. F. Ecklund, Jr. et al., <a href="http://dx.doi.org/10.1090/S0025-5718-1974-0337732-2">A new function associated with the prime factors of C(n,k)</a>, Math. Comp., 28 (1974), 647-649.
%H R. F. Lukes; R. Scheidler; H. C. Williams, <a href="http://dx.doi.org/10.1090/S0025-5718-97-00864-8">Further Tabulation of the Erdos-Selfridge Function</a>, Math. Comput. 66 (1997) 1709-1717.
%H R. Scheidler, H. C. Williams, <a href="http://dx.doi.org/10.1090/S0025-5718-1992-1134737-X">A method for tabulating the number-theoretic function g(k)</a>, Math. Comp. 59 (199) (1992) 251-257.
%H Brianna Sorenson, Jonathan P Sorenson, Jonathan Webster, <a href="https://arxiv.org/abs/1907.08559">An Algorithm and Estimates for the Erdős-Selfridge Function (work in progress)</a>, arXiv:1907.08559 [math.NT], 2019.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Erdos-SelfridgeFunction.html">Erdős-Selfridge function.</a>
%p A003458 := proc(n)
%p local m;
%p for m from n+2 do
%p if A020639( binomial(m,n)) > n then
%p return m ;
%p end if;
%p end do:
%p end proc:
%p seq(A003458(n),n=1..16) ; # _R. J. Mathar_, Mar 27 2024
%t f[n_] := Block[{k = n + 2, p = Table[Prime[i], {i, 1, PrimePi[n]}]}, While[ First[ Sort[ Mod[ Binomial[k, n], p]]] == 0, k++ ]; k]; Table[ f[n], {n, 1, 40}]
%t esf[n_]:=Module[{m=n+2},While[FactorInteger[Binomial[m,n]][[1,1]]<=n, m++];m]; Array[esf,50] (* _Harvey P. Dale_, Nov 03 2013 *)
%o (PARI) a(n) = local(m,i,f); m=0; i=n+1; while(m<=n,i=i+1; m=factor(binomial(i,n))[1,1]); i /* _Ralf Stephan_ */
%K easy,nonn,nice
%O 1,1
%A _N. J. A. Sloane_, _Simon Plouffe_
%E Extended by _Robert G. Wilson v_, Dec 01 2002
|
