A360311 -id:A360311 - cp's OEIS frontend

A360297 a(n) = minimal positive k such that the sum of the primes prime(n) + prime(n+1) + ... + prime(n+k) is divisible by prime(n+k+1), or -1 if no such k exists.

1, 3, 7, 11, 26, 20, 27, 52, 1650, 142, 53, 168234, 212, 7, 13

Offset: 1

Scott R. Shannon, Feb 02 2023

In the first 100 terms there are twenty values for which a(n) is currently unknown; for all of these values a(n) is at least 10^9. These unknown terms are for n = 16, 22, 24, 34, 41, 42, 45, 48, 50, 54, 55, 62, 68, 70, 72, 75, 80, 87, 88, 98. In this same range the largest known value is a(76) = 749597506, where prime(76) = 383 leads to a sum of primes of 6173644601523754801 that is divisible by 16865554301.
See A360311 for the sum of the k+1 primes. See A360312 for prime(n+k+1).
a(16) > 10^10. - Michael S. Branicky, Feb 19 2025
a(16) > 10^12. - Michael S. Branicky, Apr 22 2025

			a(1) = 1 as prime(1) + prime(2) = 2 + 3 = 5, which is divisible by prime(3) = 5.
a(4) = 11 as prime(4) + ... + prime(15) = 7 + 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 = 318, which is divisible by prime(16) = 53.

Scott R. Shannon, Terms for n = 1..100. The terms currently unknown are set to -1.

Cf. A360311, A360312, A000040, A007504, A332542, A332580.

from sympy import prime, nextprime
def A360297(n):
    p = prime(n)
    q = nextprime(p)
    s, k = p+q, 1
    while s%(q:=nextprime(q)):
        k += 1
        s += q
    return k # Chai Wah Wu, Feb 03 2023

A360312 The dividing prime prime(n+k+1) in A360297.

Original entry on oeis.org

5, 13, 31, 53, 131, 103, 149, 283, 14081, 883, 313, 2281229, 1429, 79, 109

Offset: 1

Scott R. Shannon, Feb 03 2023

See A360297 for further details.

Cf. A360297, A360311, A000040, A007504, A332542, A332580.

from sympy import prime, nextprime
def A360312(n):
    p = prime(n)
    q = nextprime(p)
    s, k = p+q, 1
    while s%(q:=nextprime(q)):
        k += 1
        s += q
    return q # Chai Wah Wu, Feb 06 2023

cp's OEIS Frontend

A360297 a(n) = minimal positive k such that the sum of the primes prime(n) + prime(n+1) + ... + prime(n+k) is divisible by prime(n+k+1), or -1 if no such k exists.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python