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-2 of 2 results.

A030198 a(n) = n^((n+1)^(n+2)).

Original entry on oeis.org

0, 1, 2417851639229258349412352
Offset: 0

Views

Author

Ian S. Elliott (ie3(AT)uenics.evansville.edu)

Keywords

Comments

The next four terms have 489, 9408, 195667 and 4485888 digits respectively and are too large to include. - Rick L. Shepherd, May 07 2006

Crossrefs

Cf. A103562.

Programs

A365689 Final decimal digit of n^((n+1)^(n+2)) = A030198(n).

Original entry on oeis.org

0, 1, 2, 1, 4, 5, 6, 1, 8, 1, 0, 1, 2, 1, 4, 5, 6, 1, 8, 1, 0, 1, 2, 1, 4, 5, 6, 1, 8, 1, 0, 1, 2, 1, 4, 5, 6, 1, 8, 1, 0, 1, 2, 1, 4, 5, 6, 1, 8, 1, 0, 1, 2, 1, 4, 5, 6, 1, 8, 1, 0, 1, 2, 1, 4, 5, 6, 1, 8, 1, 0, 1, 2, 1, 4, 5, 6, 1, 8, 1, 0, 1, 2, 1, 4, 5, 6
Offset: 0

Views

Author

Marco RipĂ , Sep 16 2023

Keywords

Comments

Period 10, repeat: [0, 1, 2, 1, 4, 5, 6, 1, 8, 1].

Examples

			For n = 2, a(2) = 2417851639229258349412352 mod 10 = 2.
		

Crossrefs

Cf. A030198, A103562, A120962, A365689 (initial digit).

Programs

  • Mathematica
    PadRight[{},100,{0,1,2,1,4,5,6,1,8,1}] (* Paolo Xausa, Oct 16 2023 *)
  • PARI
    a(n) = lift(Mod(n, 10)^((n+1)^(n+2))); \\ Michel Marcus, Sep 16 2023
    
  • Python
    def A365689(n): return pow(n,(n+1)**(n+2),10) # Chai Wah Wu, Sep 22 2023

Formula

a(n) = n^((n+1)^(n+2)) mod 10.
a(n) = A103562(n) for n >= 4 (as 3^(2^1) == 9 (mod 10) instead of 1).
G.f.: x*(x^8+8*x^7+x^6+6*x^5+5*x^4+4*x^3+x^2+2*x+1)/(1-x^10). - Alois P. Heinz, Apr 18 2025
Showing 1-2 of 2 results.