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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A180137 Smallest k such that k*13^n is a sum of two successive primes. 9
5, 4, 24, 4, 8, 22, 40, 4, 14, 16, 28, 10, 266, 40, 20, 46, 112, 156, 12, 20, 228, 26, 2, 220, 60, 140, 92, 42, 316, 132, 84, 70, 68, 50, 280, 164, 112, 146, 148, 30, 36, 126, 390, 30, 30, 38, 462, 114, 14, 86, 56, 168, 1600, 224, 104, 8, 72, 434, 142, 60, 750, 202, 318 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
If a(n) == 0 (mod 13), then a(n+1) = a(n)/13.
Records: 5, 24, 40, 266, 316, 390, 462, 1600, 2616, 5834, ..., .
Corresponding primes are twin primes for n = 0, 2, ..., .
LINKS
MATHEMATICA
f[n_] := Block[{k = 1, j = 13^n/2}, While[ h = k*j; PrimeQ@h || NextPrime[h, -1] + NextPrime@h != 2 h, k++ ]; k]; Array[f, 80, 0]
PROG
(Python)
from sympy import isprime, nextprime, prevprime
def ok(n):
if n <= 5: return n == 5
return not isprime(n//2) and n == prevprime(n//2) + nextprime(n//2)
def a(n):
k, pow13 = 1, 13**n
while not ok(k*pow13): k += 1
return k
print([a(n) for n in range(63)]) # Michael S. Branicky, May 04 2021
CROSSREFS
Sequence in context: A204930 A341102 A167636 * A288207 A038246 A176738
KEYWORD
nonn
AUTHOR
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 05:19 EDT 2024. Contains 371782 sequences. (Running on oeis4.)