id:A066910 - OEIS Search Results

Search: id:A066910

Displaying 1-1 of 1 results found.

page 1

a(1) = 1; a(n+1) = (sum{k=1 to n} a(k) ) (mod n).

+0
1

1, 0, 1, 2, 0, 4, 2, 3, 5, 0, 8, 4, 6, 10, 4, 5, 7, 11, 1, 17, 11, 18, 10, 15, 1, 21, 11, 16, 26, 17, 27, 16, 24, 7, 5, 1, 29, 13, 17, 25, 1, 33, 15, 20, 30, 5, 45, 33, 7, 2, 42, 22, 32, 52, 38, 8, 2, 47, 23, 32, 50, 25, 35, 55, 31, 46, 10, 3, 57, 29, 41, 65, 41, 64, 36, 53, 11, 2 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`Steven Taschuk and Phil Carmody posted to sci.math (http://www.mathforum.com/epigone/sci.math/sazhazhi ) that a(k) = 97 for k >= 398.`
	EXAMPLE	`a(7) = (1 + 0 + 1 + 2 + 0 + 4) (mod 6) = 8 (mod 6) = 2.`
	CROSSREFS	`Sequence in context: A112824 A001100 A136265 this_sequence A094405 A028609 A107490` `Adjacent sequences: A066907 A066908 A066909 this_sequence A066911 A066912 A066913`
	KEYWORD	`easy,nonn`
	AUTHOR	`Leroy Quet (qq-quet(AT)mindspring.com), Jan 22 2002`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research