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 A380132 #6 Feb 16 2025 08:34:07 %S A380132 11,13,103,15383 %N A380132 Numbers k such that (47^k + 2^k)/49 is prime. %C A380132 The definition implies that k must be a prime. %C A380132 a(5) > 10^5. %H A380132 P. Bourdelais, <a href="https://listserv.nodak.edu/cgi-bin/wa.exe?A2=NMBRTHRY;417ab0d6.0906">A Generalized Repunit Conjecture</a>. %H A380132 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 A380132 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 A380132 H. Lifchitz, <a href="http://www.primenumbers.net/Henri/us/MersFermus.htm">Mersenne and Fermat primes field</a> %H A380132 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Repunit.html">Repunit</a>. %H A380132 OEIS Wiki, <a href="https://oeis.org/wiki/Primes_of_the_form_(a%5En%2Bb%5En)/(a%2Bb)_and_(a%5En-b%5En)/(a-b)">Primes of the form (a^n+b^n)/(a+b) and (a^n-b^n)/(a-b)</a> %t A380132 Select[Prime[Range[10000]], PrimeQ[(47^# + 2^#)/49] &] %Y A380132 Cf. A057187, A057188, A062587, A062589, A127996, A127997, A128344, A204940, A217320, A225807, A228922, A229542, A375161, A375236, A377031, A377856. %K A380132 nonn,hard,more %O A380132 1,1 %A A380132 _Robert Price_, Jan 12 2025