id:A074105 - OEIS Search Results

Search: id:A074105

Displaying 1-1 of 1 results found.

page 1

Smallest multiple of the n-th prime such that the n-th partial sum is divisible by n.

+0
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; listen)

	OFFSET	`1,1`
	MAPLE	`for n from 2 to 130 do p := ithprime(n):f := 1:while(((s+fp) mod n)<>0) do f := f+1:od:a[n] := fp:s := s+a[n]:od:seq(a[i], i=1..130);`
	CROSSREFS	`Sequence in context: A039956 A118369 A082816 this_sequence A133931 A050895 A097022` `Adjacent sequences: A074102 A074103 A074104 this_sequence 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`

page 1

Search completed in 0.002 seconds

Last modified December 13 23:45 EST 2009. Contains 170824 sequences.

AT&T Labs Research