id:A073929 - OEIS Search Results

Search: id:A073929

Displaying 1-1 of 1 results found.

page 1

a(1) = 1, a(n) = smallest number not included earlier such that the n-th partial sum (n>1) is divisible by n+1.

+0
1

1, 2, 5, 7, 3, 10, 4, 13, 15, 6, 18, 20, 8, 23, 9, 26, 28, 11, 31, 12, 34, 36, 14, 39, 41, 16, 44, 17, 47, 49, 19, 52, 54, 21, 57, 22, 60, 62, 24, 65, 25, 68, 70, 27, 73, 75, 29, 78, 30, 81, 83, 32, 86, 33, 89, 91, 35, 94, 96, 37, 99, 38, 102, 104, 40, 107, 109, 42, 112, 43 (list; graph; listen)

	OFFSET	`0,2`
	EXAMPLE	`4 divides 1+2+5, but does not divide 1+2+3 or 1+2+4, so a(3)=5.`
	MAPLE	`s := {1}:summe := 1:a[1] := 1:for j from 2 to 1000 do b := (j+1)-(summe mod (j+1)); i := 0:while(true) do if nops(s union {b+i(j+1)})-nops(s)=1 then break; fi; i := i+1; od:a[j] := b+i(j+1):s := s union {b+i*(j+1)}:summe := summe+a[j]:od:c := seq(a[k], k=1..1000);`
	CROSSREFS	`Sequence in context: A024710 A140264 A140263 this_sequence A076555 A095928 A100114` `Adjacent sequences: A073926 A073927 A073928 this_sequence A073930 A073931 A073932`
	KEYWORD	`nonn`
	AUTHOR	`Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 19 2002`
	EXTENSIONS	`Corrected and edited by John W. Layman (layman(AT)math.vt.edu) and Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), Aug 21 2002`

page 1

Search completed in 0.002 seconds

Last modified December 10 12:37 EST 2009. Contains 170569 sequences.

AT&T Labs Research