OFFSET
0,5
COMMENTS
For a given n >= 0, we collect the prime factorization components of all numbers up to n + 1. Each prime power p^e maps to a point (p, e) on an integer lattice. This sequence tracks the doubled Euclidean area of the minimal convex polygon enclosing all points accumulated up to that step.
By Pick's Theorem, twice the area of any lattice polygon is always an integer, which removes the half-integers and creates a strictly nondecreasing sequence of integers, thus a(n) = 2 * A(S(n)), where S(n) is the union of points (p, e) for prime powers dividing k for 1 <= k <= n + 1 and A(S(n)) is the calculated area of the convex hull with coordinates (p,e).
EXAMPLE
For n = 3, the range of numbers is 1 to 4. The (prime, exponent) coordinates are: from 2: (2,1); from 3: (3,1); from 4: (2,2). The convex hull of {(2,1), (3,1), (2,2)} is a triangle with vertices at those three points. The area of this triangle is 1/2. Doubling it gives a(3) = 1.
For n = 7, the range of numbers is 1 to 8. The (prime, exponent) coordinates are: from 2: (2,1); from 3: (3,1); from 4: (2,2); from 5: (5,1); from 6: (2,1), (3,1); from 7: (7,1); from 8: (2,3). The convex hull of {(2,1), (3,1), (2,2), (5,1), (2,1), (3,1), (7,1), (2,3)} is a triangle with vertices at (2,1), (7,1) and (2,3). The area of this triangle is 5. Doubling it gives a(7) = 10.
PROG
(Python)
from itertools import chain
from sympy import factorint
from sympy.geometry import convex_hull
def A396682(n): return 0 if n<3 else int(2*convex_hull(*set(chain.from_iterable(factorint(k).items() for k in range(1, n+2)))).area) # Chai Wah Wu, Jun 03 2026
CROSSREFS
KEYWORD
nonn
AUTHOR
Ctibor O. Zizka, Jun 02 2026
STATUS
approved
