login
This site is supported by donations 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. 0
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; internal format)
OFFSET

1,1

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);

CROSSREFS

Sequence in context: A197930 A118369 A082816 * A179777 A190091 A186783

Adjacent sequences:  A074102 A074103 A074104 * A074106 A074107 A074108

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 22 2002

EXTENSIONS

More terms from Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Feb 01 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 05:09 EST 2012. Contains 205570 sequences.