Search: a128068 -id:a128068
|
|
A128066
|
|
Numbers k such that (3^k + 4^k)/7 is prime.
|
|
+10 17
|
|
|
3, 5, 19, 37, 173, 211, 227, 619, 977, 1237, 2437, 5741, 13463, 23929, 81223, 121271
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
All terms are primes.
|
|
LINKS
|
|
|
MAPLE
|
a:=proc(n) if type((3^n+4^n)/7, integer)=true and isprime((3^n+4^n)/7)=true then n else fi end: seq(a(n), n=1..1500); # Emeric Deutsch, Feb 17 2007
|
|
MATHEMATICA
|
Do[ p=Prime[n]; f=(3^p+4^p)/(4+3); If[ PrimeQ[f], Print[p]], {n, 1, 100} ]
|
|
PROG
|
(PARI) f(n)=(3^n + 4^n)/7;
forprime(n=3, 10^5, if(ispseudoprime(f(n)), print1(n, ", ")))
|
|
CROSSREFS
|
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Two more terms (13463 and 23929) found by Lelio R Paula in 2008 corresponding to probable primes with 8105 and 14406 digits. Jean-Louis Charton, Oct 06 2010
Two more terms (81223 and 121271) found by Jean-Louis Charton in March 2011 corresponding to probable primes with 48901 and 73012 digits
|
|
STATUS
|
approved
|
|
|
|
|
A128071
|
|
Numbers k such that (3^k + 13^k)/16 is prime.
|
|
+10 12
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
All terms are primes.
a(4) is certified prime by primo; a(5) is a probable prime. - Ray G. Opao, Aug 02 2007
|
|
LINKS
|
|
|
MATHEMATICA
|
k=13; Do[ p=Prime[n]; f=(3^p+k^p)/(k+3); If[ PrimeQ[f], Print[p]], {n, 1, 100} ]
|
|
PROG
|
|
|
CROSSREFS
|
Cf. A007658 = numbers n such that (3^n + 1)/4 is prime. Cf. A057469 = numbers n such that (3^n + 2^n)/5 is prime. Cf. A122853 = numbers n such that (3^n + 5^n)/8 is prime. Cf. A128066, A128067, A128068, A128069, A128070, A128072, A128073, A128074, A128075. Cf. A059801 = numbers n such that 4^n - 3^n is prime. Cf. A121877 = numbers n such that (5^n - 3^n)/2 is a prime. Cf. A128024, A128025, A128026, A128027, A128028, A128029, A128030, A128031, A128032.
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|
|
A128075
|
|
Numbers k such that (3^k + 19^k)/22 is prime.
|
|
+10 12
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
All terms are primes.
|
|
LINKS
|
|
|
MATHEMATICA
|
k=19; Do[ p=Prime[n]; f=(3^p+k^p)/(k+3); If[ PrimeQ[f], Print[p]], {n, 1, 9592} ]
|
|
PROG
|
|
|
CROSSREFS
|
Cf. A007658 (numbers k such that (3^k + 1)/4 is prime).
Cf. A057469 (numbers k such that (3^k + 2^k)/5 is prime).
Cf. A122853 (numbers k such that (3^k + 5^k)/8 is prime).
Cf. A059801 (numbers k such that 4^k - 3^k is prime).
Cf. A121877 (numbers k such that (5^k - 3^k)/2 is prime).
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|
|
A128072
|
|
Numbers k such that (3^k + 14^k)/17 is prime.
|
|
+10 10
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
All terms are primes.
|
|
LINKS
|
|
|
MATHEMATICA
|
k=14; Do[ p=Prime[n]; f=(3^p+k^p)/(k+3); If[ PrimeQ[f], Print[p]], {n, 1, 100} ]
|
|
PROG
|
|
|
CROSSREFS
|
Cf. A007658 (numbers k such that (3^k + 1)/4 is prime).
Cf. A057469 (numbers k such that (3^k + 2^k)/5 is prime).
Cf. A122853 (numbers k such that (3^k + 5^k)/8 is prime).
Cf. A059801 (numbers k such that 4^k - 3^k is prime).
Cf. A121877 (numbers k such that (5^k - 3^k)/2 is prime).
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|
|
A128073
|
|
Numbers k such that (3^k + 16^k)/19 is prime.
|
|
+10 10
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
All terms are primes.
|
|
LINKS
|
|
|
MATHEMATICA
|
k=16; Do[ p=Prime[n]; f=(3^p+k^p)/(k+3); If[ PrimeQ[f], Print[p]], {n, 1, 100} ]
|
|
PROG
|
|
|
CROSSREFS
|
Cf. A007658 (numbers k such that (3^k + 1)/4 is prime).
Cf. A057469 (numbers k such that (3^k + 2^k)/5 is prime).
Cf. A122853 (numbers k such that (3^k + 5^k)/8 is prime).
Cf. A059801 (numbers k such that 4^k - 3^k is prime).
Cf. A121877 (numbers k such that (5^k - 3^k)/2 is prime).
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|
|
A128067
|
|
Numbers k such that (3^k + 7^k)/10 is prime.
|
|
+10 9
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
All terms are primes.
|
|
LINKS
|
|
|
MATHEMATICA
|
k=7; Do[ p=Prime[n]; f=(3^p+k^p)/(k+3); If[ PrimeQ[f], Print[p]], {n, 1, 100} ]
|
|
PROG
|
|
|
CROSSREFS
|
Cf. A007658 = numbers n such that (3^n + 1)/4 is prime. Cf. A057469 = numbers n such that (3^n + 2^n)/5 is prime. Cf. A122853 = numbers n such that (3^n + 5^n)/8 is prime. Cf. A128066, A128068, A128069, A128070, A128071, A128072, A128073, A128074, A128075. Cf. A059801 = numbers n such that 4^n - 3^n is prime. Cf. A121877 = numbers n such that (5^n - 3^n)/2 is a prime. Cf. A128024, A128025, A128026, A128027, A128028, A128029, A128030, A128031, A128032.
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|
|
A128069
|
|
Numbers k such that (3^k + 10^k)/13 is prime.
|
|
+10 9
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
All terms are primes.
|
|
LINKS
|
|
|
MATHEMATICA
|
k=10; Do[ p=Prime[n]; f=(3^p+k^p)/(k+3); If[ PrimeQ[f], Print[p]], {n, 1, 100} ]
|
|
PROG
|
|
|
CROSSREFS
|
Cf. A007658 = numbers n such that (3^n + 1)/4 is prime. Cf. A057469 = numbers n such that (3^n + 2^n)/5 is prime. Cf. A122853 = numbers n such that (3^n + 5^n)/8 is prime. Cf. A128066, A128067, A128068, A128070, A128071, A128072, A128073, A128074, A128075. Cf. A059801 = numbers n such that 4^n - 3^n is prime. Cf. A121877 = numbers n such that (5^n - 3^n)/2 is a prime. Cf. A128024, A128025, A128026, A128027, A128028, A128029, A128030, A128031, A128032.
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|
|
A128070
|
|
Numbers k such that (3^k + 11^k)/14 is prime.
|
|
+10 9
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
All terms are primes.
|
|
LINKS
|
|
|
MATHEMATICA
|
k=11; Do[ p=Prime[n]; f=(3^p+k^p)/(k+3); If[ PrimeQ[f], Print[p]], {n, 1, 100} ]
|
|
PROG
|
|
|
CROSSREFS
|
Cf. A007658 (numbers k such that (3^k + 1)/4 is prime).
Cf. A057469 (numbers k such that (3^k + 2^k)/5 is prime).
Cf. A122853 (numbers k such that (3^k + 5^k)/8 is prime).
Cf. A059801 (numbers k such that 4^k - 3^k is prime).
Cf. A121877 (numbers k such that (5^k - 3^k)/2 is prime).
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
Search completed in 0.017 seconds
|