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.

A232056 Numbers k such that S(24*(3*k+1)) !== 8*(3*k+1) (mod 24*(3*k+1)) where S(j) := Sum_{a=0..j-1, b=0..j-1} (a+b*i)^j and i is the imaginary unit; i.e., A230309(3*k+1) != 8*(3*k+1).

Original entry on oeis.org

9, 18, 23, 37, 51
Offset: 1

Views

Author

Keywords

Comments

In most cases S(24*(3*k+1)) == 8*(3*k+1) (mod 24*(3*k+1)).

Crossrefs

Programs

  • Mathematica
    fu[n_] := fu[n] = Mod[Sum[PowerMod[i + j I, n, n], {i, 0, n - 1}, {j, 0, n - 1}], n]; Select[Range[50], ! fu[24*(3 # +1)] == 8*(3 # +1) &]