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.

A365514 Lucas-V pseudoprimes: composites c such that V_{c+1} == 2Q (mod c), where V_k is a Lucas sequence with parameters P and Q.

This page as a plain text file.
%I A365514 #9 Sep 25 2023 09:44:47
%S A365514 913,150267335403,430558874533,14760229232131,936916995253453
%N A365514 Lucas-V pseudoprimes: composites c such that V_{c+1} == 2Q (mod c), where V_k is a Lucas sequence with parameters P and Q.
%C A365514 The values are given in Table 2 in Baillie et al., 2021.
%C A365514 There are only five terms less than 10^15.
%H A365514 R. Baillie, A. Fiori, and S. S. Wagstaff, Jr., <a href="https://doi.org/10.1090/mcom/3616">Strengthening the Baillie-PSW primality test</a>, Mathematics of Computation 90 (2021), 1931-1955, arXiv:<a href="https://arxiv.org/abs/2006.14425">2006.14425</a>.
%Y A365514 Cf. A217120.
%K A365514 nonn,hard,more
%O A365514 1,1
%A A365514 _Felix Fröhlich_, Sep 07 2023