Search: id:A003458
Results 1-1 of 1 results found.
%I A003458 M2515
%S A003458 3,6,7,7,23,62,143,44,159,46,47,174,2239,239,719,241,5849,2098,2099,
%T A003458 43196,14871,19574,35423,193049,2105,36287,1119,284,240479,58782,
%U A003458 341087,371942,6459,69614,37619,152188,152189,487343,767919,85741,3017321
%N A003458 Erdos-Selfridge function: a(n) is the least number m > n+1 such that
the least prime factor of binomial(m, n) is > n.
%D A003458 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences,
Academic Press, 1995 (includes this sequence).
%D A003458 E. F. Ecklund, Jr. et al., A new function associated with the prime factors
of C(n,k), Math. Comp., 28 (1974), 647-649.
%D A003458 Lukes, R.F.; Scheidler, R.; and Williams, H.C. ``Further Tabulation of
the Erdos-Selfridge Function.'' Math. Comput. 66, 1709-1717, 1997.
%D A003458 R. Scheidler and H. C. Williams, A method of tabulating the number-theoretic
function g(k), Math. Comp., 59 (1992), 251-257.
%H A003458 T. D. Noe, Table of n, a(n) for n=1..200 (from
H. C. Williams)
%H A003458 Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
a>
%t A003458 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}]
%o A003458 (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 (from R. Stephan)
%Y A003458 Sequence in context: A067753 A129023 A152083 this_sequence A133339 A112267
A068985
%Y A003458 Adjacent sequences: A003455 A003456 A003457 this_sequence A003459 A003460
A003461
%K A003458 easy,nonn,nice
%O A003458 1,1
%A A003458 N. J. A. Sloane (njas(AT)research.att.com), Simon Plouffe (simon.plouffe(AT)gmail.com)
%E A003458 Extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 01 2002
Search completed in 0.001 seconds