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.

Showing 1-1 of 1 results.

A129810 9^(9^9) mod n.

Original entry on oeis.org

0, 1, 0, 1, 4, 3, 1, 1, 0, 9, 5, 9, 1, 1, 9, 9, 9, 9, 1, 9, 15, 5, 8, 9, 14, 1, 0, 1, 9, 9, 4, 9, 27, 9, 29, 9, 1, 1, 27, 9, 9, 15, 11, 5, 9, 31, 34, 9, 15, 39, 9, 1, 9, 27, 49, 1, 39, 9, 28, 9, 34, 35, 36, 9, 14, 27, 22, 9, 54, 29, 12, 9, 72, 1, 39, 1, 71, 27, 21, 9, 0, 9, 61, 57, 9, 11, 9, 49, 42
Offset: 1

Views

Author

Marvin Ray Burns, May 19 2007

Keywords

Comments

Eventually constant: a(n) = 9^9^9 for all n > 9^9^9 ~ 4.28*10^369693099. - M. F. Hasler, Feb 24 2018

Examples

			[9^(9^9)] mod 1 =0
[9^(9^9)] mod 2 =1
[9^(9^9)] mod 9 =0
[9^(9^9)] mod (3*387420489) =0
		

Crossrefs

Cf. A081230, A214128 (6^6^6 mod n).

Programs

  • Mathematica
    Table[PowerMod[9, 9^9, n], {n, 1, 100}]
  • PARI
    a(n)=lift(Mod(9,n)^9^9) \\ Charles R Greathouse IV, Jul 02 2012

Formula

a(n) = 0 for all n = 3^k, 0 <= k <= 2*9^9; a(n) = 9^9^9 for all n > 9^9^9. - M. F. Hasler, Feb 24 2018
Showing 1-1 of 1 results.