id:A090183 - OEIS Search Results

Search: id:A090183

Displaying 1-1 of 1 results found.

page 1

a(n) = Mod[10-Mod[Prime[n+3],10],4]-Mod[n,4]+3

+0
1

5, 2, 3, 6, 3, 4, 1, 4, 5, 2, 3, 6, 5, 2, 1, 6, 3, 4, 1, 6, 3, 4, 1, 6, 5, 2, 3, 6, 3, 4, 1, 4, 3, 4, 3, 6, 5, 2, 1, 4, 5, 4, 1, 4, 5, 4, 1, 6, 3, 2, 1, 6, 5, 2, 1, 6, 3, 4, 3, 6, 3, 4, 3, 4, 5, 4, 1, 6, 3, 4, 3, 4, 5, 2, 3, 4, 3, 2, 1, 4, 5, 2, 3, 4, 5, 2, 3, 6, 3, 4, 1, 4, 5, 2, 1, 6, 3, 4, 3, 6, 3, 2, 3, 6, 5 (list; graph; listen)

	OFFSET	`3,1`
	COMMENT	`A coding of the primes {1,3,7,9} digits using mode using modulo four as a pretransform.` `This coding loses one degree of freedom in the process.`
	MATHEMATICA	`digits=200 Table[Mod[10-Mod[Prime[n+3], 10], 4]-Mod[n, 4]+3, {n, 1, digits}]`
	CROSSREFS	`Sequence in context: A097078 A021195 A019673 this_sequence A063572 A131567 A114746` `Adjacent sequences: A090180 A090181 A090182 this_sequence A090184 A090185 A090186`
	KEYWORD	`nonn`
	AUTHOR	`Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jan 20 2004`

page 1

Search completed in 0.002 seconds

Last modified December 11 12:57 EST 2009. Contains 170656 sequences.

AT&T Labs Research