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.

A233398 n^n mod 3^n.

Original entry on oeis.org

0, 1, 4, 0, 13, 209, 0, 1231, 739, 0, 51850, 129587, 0, 657067, 868120, 0, 8400886, 91426058, 0, 859535812, 1483912651, 0, 30374372956, 68688648677, 0, 422259655777, 2129293909882, 0, 11623487749588, 44275834126985, 0, 329933248712302, 971441847750184, 0, 927342285792613
Offset: 0

Views

Author

Alex Ratushnyak, Dec 08 2013

Keywords

Comments

Conjecture: a(x) equals zero for every x that's a multiple of 3. - Harvey P. Dale, Jan 10 2025

Crossrefs

Programs

  • Mathematica
    Table[PowerMod[n,n,3^n],{n,0,40}] (* Harvey P. Dale, Jan 10 2025 *)
  • Python
    for n in range(55): print(f"{n**n % 3**n}, ")
Showing 1-1 of 1 results.