login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A074105 Smallest multiple of the n-th prime such that the n-th partial sum is divisible by n. 1
2, 6, 10, 14, 33, 13, 34, 152, 69, 87, 31, 185, 287, 43, 564, 742, 295, 61, 469, 923, 1314, 474, 747, 1869, 776, 1616, 1442, 1070, 2071, 3051, 2413, 1441, 1918, 2502, 4321, 4379, 3611, 2119, 4008, 1038, 6444, 3258, 3438, 6176, 6304, 8358, 8229, 8697 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
MAPLE
for n from 2 to 130 do p := ithprime(n):f := 1:while(((s+f*p) mod n)<>0) do f := f+1:od:a[n] := f*p:s := s+a[n]:od:seq(a[i], i=1..130);
MATHEMATICA
s = 0; Table[p = Prime[n]; k = 1; While[! Divisible[s + (x = k*p), n], k++]; s += x; x, {n, 48}] (* Jayanta Basu, Aug 01 2013 *)
CROSSREFS
Sequence in context: A236423 A362230 A082816 * A329657 A179777 A285959
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Aug 22 2002
EXTENSIONS
More terms from Sascha Kurz, Feb 01 2003
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 09:49 EDT 2024. Contains 371967 sequences. (Running on oeis4.)