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.

A224503 Smallest nontrivial prime power congruent to 1 mod n.

Original entry on oeis.org

3, 4, 5, 11, 7, 8, 9, 19, 11, 23, 13, 27, 29, 16, 17, 103, 19, 191, 41, 43, 23, 47, 25, 101, 27, 109, 29, 59, 31, 32, 97, 67, 103, 71, 37, 149, 191, 79, 41, 83, 43, 173, 89, 181, 47, 283, 49, 197, 101, 103, 53, 107, 109, 331, 113, 229, 59
Offset: 2

Views

Author

R. J. Mathar, Apr 08 2013

Keywords

Crossrefs

Programs

  • Maple
    A224503 := proc(n)
        local i;
        for i from 2 do
            if (A000961(i) mod n) = 1 then
                 return A000961(i);
            end if;
        end do:
    end proc:
    seq(A224503(n), n=2..100);
  • Mathematica
    a[n_] := For[k = 2, True, k++, If[PrimePowerQ[k], If[Mod[k, n] == 1, Return[k]]]];
    Table[a[n], {n, 2, 100}] (* Jean-François Alcover, May 18 2018 *)