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.

A298757 Numbers k with record value of the least strong pseudoprime to base k (A298756).

This page as a plain text file.
%I A298757 #32 Mar 09 2022 16:20:21
%S A298757 2,1320,4712,5628,7252,7852,14787,17340,61380,78750,254923,486605,
%T A298757 1804842,4095086,12772344,42162995
%N A298757 Numbers k with record value of the least strong pseudoprime to base k (A298756).
%C A298757 The record strong pseudoprimes are 2047, 4097, 4711, 5627, 7251, 7851, 9409, 10261, 11359, 13747, 18299, 25761, 32761, 38323, 40501, 97921, ...
%H A298757 <a href="/index/Ps#pseudoprimes">Index entries for sequences related to pseudoprimes</a>
%t A298757 sppQ[n_?EvenQ, _] := False; sppQ[n_?PrimeQ, _] := False; sppQ[n_, b_] := Module[{ans=False},s = IntegerExponent[n-1, 2]; d = (n-1)/2^s; If[ PowerMod[b, d, n] == 1, ans=True, Do[If[PowerMod[b, d*2^r, n] == n-1, ans=True], {r, 0, s-1}]];ans]; smallestSPP[b_] := Module[ {k=3}, While[ !sppQ[k,b],k+=2];k ]; sm=0;a={};Do[s=smallestSPP[b];If[s>sm,sm=s;AppendTo[a,b]], {b,2,10^4}];a (* after _Jean-François Alcover_ at A020229 *)
%o A298757 (PARI) lista(nn) = {my(m=0); for (n=2, nn, my(r=a298756(n)); if (r>m, m =r; print1(n, ", ")););} \\ _Michel Marcus_, Jan 31 2022; using pari code in A298756
%Y A298757 Cf. A001262, A020229, A020230, A020231, A020232, A020233, A020234, A020235, A298756.
%K A298757 nonn,more
%O A298757 1,1
%A A298757 _Amiram Eldar_, Jan 26 2018
%E A298757 a(9)-a(16) from _Jonathan Pappas_, Jan 31 2022