id:A088521 - OEIS Search Results

Search: id:A088521

Displaying 1-1 of 1 results found.

page 1

a(1) = 1; for n > 1, a(n) = (a(n-1) + n) mod prime(n).

+0
3

1, 0, 3, 0, 5, 11, 1, 9, 18, 28, 8, 20, 33, 4, 19, 35, 52, 9, 28, 48, 69, 12, 35, 59, 84, 9, 36, 64, 93, 10, 41, 73, 106, 1, 36, 72, 109, 147, 19, 59, 100, 142, 185, 36, 81, 127, 174, 222, 44, 94, 145, 197, 9, 63, 118, 174, 231, 18, 77, 137, 198, 260, 16, 80, 145, 211, 278, 9 (list; graph; listen)

	OFFSET	`1,3`
	MATHEMATICA	`a[1] = 1; a[n_] := a[n] = Mod[a[n - 1] + n, Prime[n]]; Table[ a[n], {n, 69}]`
	CROSSREFS	`Cf. A088522, A088523, A006257.` `Sequence in context: A103229 A076296 A143280 this_sequence A022837 A088969 A009780` `Adjacent sequences: A088518 A088519 A088520 this_sequence A088522 A088523 A088524`
	KEYWORD	`nonn,easy`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Nov 14 2003`
	EXTENSIONS	`More terms from Robert G. Wilson v (rgwv(AT)rgwv.com) and Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 15 2003`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research