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.

A117324 Prime(10^n) modulo semiprime(10^n).

Original entry on oeis.org

2, 3, 227, 729, 22965, 380555, 156346, 10920166, 202913258, 2973399074, 39284376410, 489544827463, 5874954672992
Offset: 0

Views

Author

Jonathan Vos Post, Mar 08 2006

Keywords

Examples

			prime(10^0) modulo semiprime(10^0) = 2 mod 4 = 2.
prime(10^1) modulo semiprime(10^1) = 29 mod 26 = 3.
prime(10^2) modulo semiprime(10^2) = 541 mod 314 = 227.
		

Formula

a(n) = A000040(10^n) modulo A001358(10^n). a(n) = A117322(10^n). a(n) = A006988(n) modulo A114125(n).

Extensions

a(12) from Zak Seidov