id:A088522 - OEIS Search Results

Search: id:A088522

Displaying 1-1 of 1 results found.

page 1

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

+0
3

2, 1, 4, 1, 6, 12, 2, 10, 19, 0, 11, 23, 36, 7, 22, 38, 55, 12, 31, 51, 72, 15, 38, 62, 87, 12, 39, 67, 96, 13, 44, 76, 109, 4, 39, 75, 112, 150, 22, 62, 103, 145, 188, 39, 84, 130, 177, 2, 51, 101, 152, 204, 16, 70, 125, 181, 238, 25, 84, 144, 205, 267, 23, 87, 152, 218, 285 (list; graph; listen)

	OFFSET	`1,1`
	MATHEMATICA	`a[1] = 2; a[n_] := a[n] = Mod[a[n - 1] + n, Prime[n]]; Table[ a[n], {n, 67}]`
	CROSSREFS	`Cf. A088521, A088523, A006257.` `Sequence in context: A146386 A128099 A108952 this_sequence A115124 A115122 A097360` `Adjacent sequences: A088519 A088520 A088521 this_sequence A088523 A088524 A088525`
	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 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research