The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A112130 Numbers k such that (3^j)*k + 1 are primes for j=0 to 7. 2
 25451790, 29445850, 76355370, 218715490, 236862990, 380011170, 514144750, 628241740, 777146230, 882792120, 930646080, 944173860, 1105472340, 1349221230, 1542434250, 1564227910, 1832212270, 1898927100, 1994085030 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Each term is a multiple of 70. The proof is straightforward. Example step showing k <> 3 (mod 7): If k==3 (mod 7), then (3^2)*k+1 == 9*3+1 == 0 (mod 7); i.e., for j=2 (3^j)*k+1 is never prime in this case. A corresponding j value with 0<=j<=7 can be found for each modulus (2,5,7) and nonzero residue such that (3^j)*k+1 is composite (a multiple of that modulus) so that only k == 0 (mod 2), k == 0 (mod 5) and k == 0 (mod 7) remain, hence k == 0 (mod 70). - Rick L. Shepherd, Sep 03 2005 LINKS Jinyuan Wang, Table of n, a(n) for n = 1..500 PROG (PARI) forstep(k=70, 3*10^9, 70, j=0; while(isprime((3^j)*k+1), j++); if(j>=8, print1(k, ", "))); \\ Rick L. Shepherd, Sep 03 2005 CROSSREFS Subsequence of A112129. Sequence in context: A172795 A056915 A233448 * A334373 A120702 A206317 Adjacent sequences:  A112127 A112128 A112129 * A112131 A112132 A112133 KEYWORD nonn AUTHOR Pierre CAMI, Aug 27 2005 EXTENSIONS More terms from Rick L. Shepherd, Sep 03 2005 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 26 04:43 EDT 2022. Contains 354074 sequences. (Running on oeis4.)