Lattice slices

Fix z to see one plane of the 3D count, or switch to the full 2D lattice.

Integer inputs

F₃(6, 6) = 83

At least one zero
64
All coordinates positive
19
Positive sum cap
6
Integer lattice at z = 1Accepted zero-product points are circles. Accepted positive points are squares. Crosses fail a constraint.xy
Slice z = 1 contains 21 accepted points. ● Zero product ■ Positive product × Excluded

Exact bounded reference, not the fast research algorithm. No native C++ code runs here. Browser time is not a C++ benchmark.

Read the article