cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

User: Xueshi Gao

Xueshi Gao's wiki page.

Xueshi Gao has authored 1 sequences.

A243239 a(n) = 10^n mod 97.

Original entry on oeis.org

1, 10, 3, 30, 9, 90, 27, 76, 81, 34, 49, 5, 50, 15, 53, 45, 62, 38, 89, 17, 73, 51, 25, 56, 75, 71, 31, 19, 93, 57, 85, 74, 61, 28, 86, 84, 64, 58, 95, 77, 91, 37, 79, 14, 43, 42, 32, 29, 96, 87, 94, 67, 88, 7, 70, 21, 16, 63, 48, 92, 47, 82, 44, 52, 35, 59, 8, 80, 24, 46, 72, 41, 22, 26, 66, 78, 4, 40, 12, 23, 36, 69, 11, 13, 33, 39, 2, 20, 6, 60, 18, 83, 54, 55, 65, 68
Offset: 0

Author

Xueshi Gao, Jun 01 2014

Keywords

Comments

a(n) is the remainder of 10^n divided by 97. Repeats after 96 terms.

Examples

			For n=6, a(6)=27.
		

Programs

Extensions

Changed offset; made it into an infinite sequence. - N. J. A. Sloane, Jun 25 2014