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.

A232057 Numbers k such that S(24*(3*k-1)) <> 16*(3*k-1) mod 24*(3*k-1) where S(k) := Sum_{0<=a

Original entry on oeis.org

5, 19, 37, 47, 61, 75
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Mathematica
    fu[n_] := fu[n] = Mod[Sum[PowerMod[i + j I, n, n], {i, 0, n - 1}, {j, 0, n - 1}], n]; Table[If[! fu[24(3n - 1)]/(3n - 1) == 16, Print[n]; n], {n, 1, 40}]
Showing 1-1 of 1 results.