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.

A256348 Moduli n for which A248218(n) = 8.

Original entry on oeis.org

193, 386, 461, 523, 579, 772, 887, 922, 1019, 1046, 1158, 1351, 1383, 1544, 1569, 1774, 1844, 1861, 2038, 2092, 2123, 2153, 2269, 2316, 2509, 2661, 2702, 2766, 2887, 3057, 3088, 3138, 3227, 3391, 3449, 3541, 3548, 3661, 3667, 3688, 3722, 3919
Offset: 1

Views

Author

M. F. Hasler, Mar 25 2015

Keywords

Comments

If x and y are members, then so is LCM(x,y). - Robert Israel, Mar 08 2021

Crossrefs

Programs

  • Maple
    filter:= proc(n) local x,k,R;
      x:= 0; R[0]:= 0;
      for k from 1 do
        x:= x^2+1 mod n;
        if assigned(R[x]) then return evalb(k-R[x] = 8)
        else R[x]:= k fi
      od;
    end proc:
    select(filter, [$1..5000]); # Robert Israel, Mar 08 2021
  • Mathematica
    filter[n_] := Module[{x, k, R}, x = 0; R[0] = 0; For[k = 1, True, k++, x = Mod[x^2+1, n]; If[IntegerQ[R[x]], Return[k - R[x] == 8], R[x] = k]]];
    Select[Range[4000], filter] (* Jean-François Alcover, May 15 2023, after Robert Israel *)
  • PARI
    for(i=1,3000,A248218(i)==8&&print1(i","))