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.
%I A300762 #16 Aug 18 2018 05:57:15 %S A300762 35333,42799,49981,60787,150851,162193,164737,241001,253241,256999, %T A300762 280601,452051,481573,556169,617093,665333,722201,838861,1016801, %U A300762 1252697,1507963,1534541,1678541,1826203,2134277,2269093,2304167,2313697,2537641,2617451,2811271 %N A300762 Numbers k > 1 such that 2^k == 2 (mod k) and gcd(k, 3^k - 3) = 1. %C A300762 Numbers k > 1 such that 2^(k-1) == 1 (mod k) and gcd(k, 3^(k-1)-1) = 1. %C A300762 Are there infinitely many such "anti-Carmichael pseudoprimes (2,3)"? %t A300762 Select[Range[2 10^6], PowerMod[2, #, #] == 2 && GCD[#, # + PowerMod[3, #, #] - 3] == 1 &] (* _Giovanni Resta_, Aug 18 2018 *) %o A300762 (PARI) isok(k) = (k != 1) && (Mod(2, k)^k == Mod(2, k)) && (gcd(k, 3^k - 3) == 1); \\ _Michel Marcus_, Aug 15 2018 %Y A300762 Subsequence of A001567 and of A316907 and probably of A121707. %K A300762 nonn %O A300762 1,1 %A A300762 _Thomas Ordowski_, Aug 15 2018 %E A300762 More terms from _Michel Marcus_, Aug 15 2018 %E A300762 More terms from _Giovanni Resta_, Aug 18 2018