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!)
A057943 Numbers k such that the smallest palindromic pseudoprime to base k is 101101. 1

%I #14 Apr 03 2023 10:36:09

%S 2,51,60,75,96,200,207,279,288,348,402,432,464,492,500,531,555,590,

%T 646,652,662,675,695,732,750,790,843,855,860,888,894,920,927,983,984,

%U 1074,1102,1139,1140,1150,1152,1163,1164,1203,1215,1230,1251,1278,1283,1336

%N Numbers k such that the smallest palindromic pseudoprime to base k is 101101.

%H Amiram Eldar, <a href="/A057943/b057943.txt">Table of n, a(n) for n = 1..10000</a>

%H C. K. Caldwell, <a href="https://t5k.org/glossary/page.php?sort=CarmichaelNumber">Carmichael number</a>

%H C. K. Caldwell, <a href="https://t5k.org/glossary/page.php?sort=Pseudoprime">Pseudoprimes</a>

%H C. Rivera, <a href="http://www.primepuzzles.net/problems/prob_024.htm">Carmichael Numbers</a>

%H <a href="/index/Ps#pseudoprimes">Index entries for sequences related to pseudoprimes</a>

%e 2 is a term since 101101 is the least Fermat pseudoprime to base 2 (A001567) which is also a palindrome in base 10 (A002113).

%e 3 is not a term since the least Fermat pseudoprime to base 3 (A005935) which is also a palindrome in base 10 is 121.

%t palinComps = Select[Range[2, 101100], PalindromeQ[#] && CompositeQ[#] &]; seqQ[n_] := PowerMod[n, 101100, 101101] == 1 && AllTrue[palinComps, PowerMod[n, #-1, #] != 1 &]; Select[Range[1336], seqQ] (* _Amiram Eldar_, Jan 30 2020 *)

%Y Cf. A001567, A002113, A002997.

%K nonn,base

%O 1,1

%A _Patrick De Geest_, Oct 15 2000

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 March 28 14:33 EDT 2024. Contains 371254 sequences. (Running on oeis4.)