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.

A057178 Numbers k such that (12^k + 1)/13 is a prime.

This page as a plain text file.
%I A057178 #32 Feb 16 2025 08:32:43
%S A057178 5,11,109,193,1483,11353,21419,21911,24071,106859,139739,495953
%N A057178 Numbers k such that (12^k + 1)/13 is a prime.
%C A057178 (12^1483 + 1)/13, a 1600-digit number, has now been certified prime with Primo. - _Rick L. Shepherd_, May 01 2002
%H A057178 Paul Bourdelais, <a href="https://listserv.nodak.edu/cgi-bin/wa.exe?A2=NMBRTHRY;417ab0d6.0906">A Generalized Repunit Conjecture</a>
%H A057178 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 A057178 H. Dubner and T. Granlund, <a href="https://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 A057178 H. Lifchitz, <a href="http://www.primenumbers.net/Henri/us/MersFermus.htm">Mersenne and Fermat primes field</a>
%H A057178 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Repunit.html">Repunit</a>
%t A057178 lst={};Do[p=(12^n+1)/13;If[PrimeQ[p], AppendTo[lst, n]], {n, 7!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Sep 29 2008 *)
%Y A057178 Different from A056265.
%K A057178 nonn
%O A057178 1,1
%A A057178 _N. J. A. Sloane_, Sep 15 2000
%E A057178 More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Jan 05 2008
%E A057178 a(10) corresponds to a probable prime, discovered by _Paul Bourdelais_, Feb 08 2010
%E A057178 a(11) corresponds to a probable prime, discovered by _Paul Bourdelais_, Sep 21 2011
%E A057178 a(12) corresponds to a probable prime, discovered by _Paul Bourdelais_, Nov 13 2018