id:A088523 - OEIS Search Results

Search: id:A088523

Displaying 1-1 of 1 results found.

page 1

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

+0
3

2, 1, 0, 3, 4, 5, 1, 4, 0, 9, 7, 8, 10, 11, 13, 2, 10, 17, 8, 19, 8, 21, 12, 5, 2, 25, 20, 15, 8, 1, 4, 7, 12, 15, 24, 31, 3, 14, 25, 38, 12, 25, 1, 18, 35, 4, 27, 10, 41, 20, 49, 28, 4, 39, 21, 4, 45, 26, 8, 49, 27, 10, 2, 57, 45, 32, 28, 25, 27, 26, 24, 23, 25, 28, 32, 35, 39, 46, 52, 61 (list; graph; listen)

	OFFSET	`1,1`
	MATHEMATICA	`a[1] = 2; a[n_] := a[n] = Mod[a[n - 1] + Prime[n], n]; Table[a[n], {n, 68, 81}]`
	CROSSREFS	`Cf. A088521, A088522, A006257.` `Adjacent sequences: A088520 A088521 A088522 this_sequence A088524 A088525 A088526` `Sequence in context: A094301 A135488 A099493 this_sequence A145460 A035543 A105546`
	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 8 20:39 EST 2009. Contains 166234 sequences.

AT&T Labs Research