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.

A233442 a(n) = 2^n mod n^3.

Original entry on oeis.org

0, 4, 8, 16, 32, 64, 128, 256, 512, 24, 717, 640, 1601, 2664, 2393, 0, 3334, 5536, 3004, 576, 4166, 9640, 5545, 8704, 7557, 3696, 19034, 6400, 20244, 5824, 29204, 0, 21293, 12176, 13493, 40960, 41146, 25008, 16154, 11776, 55680, 56008, 20642, 79040, 14957, 1016
Offset: 1

Views

Author

Alex Ratushnyak, Dec 09 2013

Keywords

Crossrefs

Programs

  • Mathematica
    Array[PowerMod[2, #, #^3] &, 50] (* Paolo Xausa, Mar 27 2025 *)
  • Python
    for n in range(1,100):  print(2**n % n**3, end=', ')

Formula

a(n) = A000079(n) mod A000578(n).