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.

A070705 LCM of first n prime powers modulo next prime power.

Original entry on oeis.org

2, 2, 2, 4, 4, 3, 1, 4, 8, 5, 14, 15, 5, 18, 1, 20, 16, 2, 15, 15, 8, 21, 29, 21, 16, 32, 29, 23, 22, 30, 54, 71, 37, 7, 37, 43, 45, 30, 36, 77, 100, 72, 64, 7, 56, 33, 42, 54, 132, 18, 90, 156, 91, 29, 86, 149, 139, 111, 112, 96, 62, 5, 204, 103, 41, 197, 81, 218, 128, 238, 58
Offset: 1

Views

Author

Lekraj Beedassy, May 15 2002

Keywords

Examples

			The case n=7 implies a(7) = A051451(7) (mod A000961(8)) = lcm(2,3,4,5,7,8,9) (mod 11) = 2520 (mod 11) = 1.
		

Crossrefs

Formula

a(n) = A051451(n) (mod A000961(n+1)) = A051126(A051451(n), A000961(n-1)).

Extensions

More terms from Don Reble, May 16 2002