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 A364701 #27 Mar 05 2024 16:46:54 %S A364701 1531398,114009582,940084647,4206644978,7962908038,20293639091, %T A364701 41947594698 %N A364701 Pseudoprimes corresponding to a Perrin-like primality test. %C A364701 The sequence b(n) defined by the generating function (3*x^4+5*x^2+6*x-7)/(4*x^7+x^4+x^2+x-1) has the property that b(p) == 1 (mod p) if p is a prime. A pseudoprime for b(n) is a composite number k such that b(k) == 1 (mod k). %C A364701 The first seven pseudoprimes are the only ones up to 10^12. %H A364701 Robert Dougherty-Bliss and Doron Zeilberger, <a href="https://arxiv.org/abs/2307.16069v1">Lots and Lots of Perrin-Type Primality Tests and Their Pseudo-Primes</a>, arXiv:2307.16069 [math.NT], 2023. %e A364701 The value of b(1531398) is a 399290-digit number which is congruent to 1 modulo 1531398 = 2 * 3 * 11 * 23203. %Y A364701 b(n) is A362923. %Y A364701 Cf. A001608, A013998, A018187. %K A364701 nonn,more %O A364701 1,1 %A A364701 _Robert Dougherty-Bliss_, Aug 03 2023