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.

A379428 Numbers k such that (39^k + 2^k)/41 is prime.

This page as a plain text file.
%I A379428 #5 Feb 16 2025 08:34:07
%S A379428 3,5,19,2543,4691,14669,19819,53891,83137
%N A379428 Numbers k such that (39^k + 2^k)/41 is prime.
%C A379428 The definition implies that k must be a prime.
%C A379428 a(10) > 10^5.
%H A379428 P. Bourdelais, <a href="https://listserv.nodak.edu/cgi-bin/wa.exe?A2=NMBRTHRY;417ab0d6.0906">A Generalized Repunit Conjecture</a>.
%H A379428 J. Brillhart et al., <a href="http://dx.doi.org/10.1090/conm/022">Factorizations of b^n +- 1</a>, Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 3rd edition, 2002.
%H A379428 H. Dubner and T. Granlund, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL3/DUBNER/dubner.html">Primes of the Form (b^n+1)/(b+1)</a>, J. Integer Sequences, 3 (2000), #P00.2.7.
%H A379428 H. Lifchitz, <a href="http://www.primenumbers.net/Henri/us/MersFermus.htm">Mersenne and Fermat primes field</a>
%H A379428 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Repunit.html">Repunit</a>.
%t A379428 Select[Prime[Range[10000]], PrimeQ[(39^# + 2^#)/41] &]
%Y A379428 Cf. A057187, A057188, A062587, A062589, A127996, A127997, A128344, A204940, A217320, A225807, A228922, A229542, A375161, A375236, A377031, A377856.
%K A379428 nonn,hard,more
%O A379428 1,1
%A A379428 _Robert Price_, Dec 22 2024