OFFSET
1,3
COMMENTS
It follows from a theorem of Daniel Shiu that m always exists. See A111287 for details. - N. J. A. Sloane, Nov 05 2005
REFERENCES
Felice Russo, A set of new Smarandache functions, sequences and conjectures in number theory, American Research Press 2000
LINKS
Alois P. Heinz, Table of n, a(n) for n = 1..20000 (first 1000 terms from T. D. Noe)
D. K. L. Shiu, Strings of Congruent Primes, J. Lond. Math. Soc. 61 (2) (2000) 359-373 [MR1760689]
FORMULA
MAPLE
read transforms; M:=1000; p0:=[seq(ithprime(i), i=1..M)]; q0:=PSUM(p0); w:=[]; for n from 1 to M do p:=n; hit := 0; for i from 1 to M do if q0[i] mod p = 0 then w:=[op(w), i]; hit:=1; break; fi; od: if hit = 0 then break; fi; od: w;
MATHEMATICA
Transpose[With[{aprs=Thread[{Range[500], Accumulate[Prime[Range[ 500]]]}]}, Flatten[Table[ Select[ aprs, Divisible[Last[#], n]&, 1], {n, 80}], 1]]][[1]] (* Harvey P. Dale, Dec 14 2011 *)
PROG
(Haskell)
a053050 n = head [k | (k, x) <- zip [1..] a007504_list, mod x n == 0]
-- Reinhard Zumkeller, Oct 04 2015, Feb 10 2012
CROSSREFS
KEYWORD
easy,nice,nonn
AUTHOR
Felice Russo, Feb 25 2000
EXTENSIONS
More terms from N. J. A. Sloane, Nov 05 2005
STATUS
approved