id:A130165 - OEIS Search Results

Search: id:A130165

Displaying 1-1 of 1 results found.

page 1

a(0)=1; a(n)=prime(mod(a(n-1),10)).

+0
1

1, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Starting with the second term, cycles every four terms.` `Not the same sequence as a(0)=1; a(n)=mod(prime(a(n-1)),10).`
	FORMULA	`a(0)=1; a(n)=prime(mod(a(n-1),10)).`
	MATHEMATICA	`f[s_List] := Block[{}, Append[s, Prime@ Last@ Mod[s, 10]]]; Nest[f, {1}, 93]`
	CROSSREFS	`Sequence in context: A003182 A134294 A154956 this_sequence A083397 A067362 A131200` `Adjacent sequences: A130162 A130163 A130164 this_sequence A130166 A130167 A130168`
	KEYWORD	`nonn,less`
	AUTHOR	`Robert G. Wilson v (rgwv(AT)rgwv.com), May 13 2007`

page 1

Search completed in 0.002 seconds

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.

AT&T Labs Research