login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A256348 Moduli n for which A248218(n) = 8. 2

%I #12 May 15 2023 08:43:52

%S 193,386,461,523,579,772,887,922,1019,1046,1158,1351,1383,1544,1569,

%T 1774,1844,1861,2038,2092,2123,2153,2269,2316,2509,2661,2702,2766,

%U 2887,3057,3088,3138,3227,3391,3449,3541,3548,3661,3667,3688,3722,3919

%N Moduli n for which A248218(n) = 8.

%C If x and y are members, then so is LCM(x,y). - _Robert Israel_, Mar 08 2021

%H Robert Israel, <a href="/A256348/b256348.txt">Table of n, a(n) for n = 1..10000</a>

%p filter:= proc(n) local x,k,R;

%p x:= 0; R[0]:= 0;

%p for k from 1 do

%p x:= x^2+1 mod n;

%p if assigned(R[x]) then return evalb(k-R[x] = 8)

%p else R[x]:= k fi

%p od;

%p end proc:

%p select(filter, [$1..5000]); # _Robert Israel_, Mar 08 2021

%t 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]]];

%t Select[Range[4000], filter] (* _Jean-François Alcover_, May 15 2023, after _Robert Israel_ *)

%o (PARI) for(i=1,3000,A248218(i)==8&&print1(i","))

%Y Cf. A248218, A248219, A256342 - A256349, A003095, A247981.

%K nonn

%O 1,1

%A _M. F. Hasler_, Mar 25 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 15 11:45 EDT 2024. Contains 375938 sequences. (Running on oeis4.)