OFFSET
1,1
COMMENTS
All such numbers are answers to the question: How many plane regions result from partitioning by two sets of straight lines, such that:
Each of the k straight lines of the first bundle passes though a single point A, and intersects each of the m straight lines of the second bundle each of which passes through a different point B. There are no straight lines belonging to both bundles, i.e. the line AB is not involved.
Because k*m+2*(k+m)-1 = (k+2)*(m+2)-5, and k and m are both positive, a(n) = A264828(n+2) - 5. - Kevin Ryde, Mar 26 2024
LINKS
Nicolay Avilov, Explanatory drawing.
Nicolay Avilov, Illustration for terms a(1) - a(6).
FORMULA
If there are k straight lines in the first bundle and m straight lines in the second bundle, then we get k*m + 2*(k + m) - 1 regions.
EXAMPLE
4 is a term: if each bundle consists of one straight line, the plane is divided into 4 regions.
7 is a term: if the first bundle consists of one line and the second consists of two lines, the plane is divided into 7 regions.
These and other examples are illustrated in the linked figures.
PROG
(PARI) print(Vec(setbinop((k, m)->k*m + 2*(k + m) - 1, [1..112]), 69)) \\ Michel Marcus, Mar 02 2024
(Python)
maxval = 112
av = [[k*m+2*k+2*m-1 for k in range(1, maxval)] for m in range(1, maxval)]
flat = [n for row in av for n in row]
uniq = list(set(flat))
a370759 = list(filter(lambda x: x<=maxval, uniq))
print(a370759)
# Robert Munafo, Mar 25 2024
(Python)
from itertools import count, islice
from sympy import isprime
def A370759_gen(startvalue=4): # generator of terms >= startvalue
return filter(lambda n:not (isprime(n+5) or (n&1 and isprime((n>>1)+3))), count(max(startvalue, 4)))
CROSSREFS
KEYWORD
nonn
AUTHOR
Nicolay Avilov, Mar 01 2024
STATUS
approved