OFFSET
0,2
COMMENTS
For n>0, a(n) is the maximum number of regions the plane can be divided into by drawing two n-chains (both finite and infinite regions are counted). See A386478 for further information.
We do not at present have an explicit construction that will achieve a(n) for n > 5.
LINKS
David O. H. Cutler, Jonas Karlsson, and Neil J. A. Sloane, Cutting a Pancake with an Exotic Knife, arXiv:2511.15864[math.CO], v3, April 19 2026.
N. J. A. Sloane, Illustration for a(3) = 14. Two 3-chains can divide the plane into at most 14 regions.
N. J. A. Sloane, Two 4-chains can divide the plane into at most a(4) = 25 regions. (The two 4-chains are colored respectively black and green.)
N. J. A. Sloane, Two 5-chains can divide the plane into at most a(5) = 40 regions. (The two 5-chains are colored respectively black and red.) It would be nice to have a clearer picture. Region 36 is tiny. Also some of the points where arms of the 5-chains meet are just outside the region shown.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).
FORMULA
From Stefano Spezia, Jul 26 2025: (Start)
G.f.: -x*(4-5*x+5*x^2) / (x-1)^3.
E.g.f.: exp(x)*(5 - x + 2*x^2) - 5. (End)
MATHEMATICA
LinearRecurrence[{3, -3, 1}, {5, 4, 7}, 60] (* or *) a[n_]:=2n^2-3n+5; Array[a, 60, 0] (* James C. McMahon, Jul 26 2025 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Jul 25 2025
EXTENSIONS
Changed a(0) so as to match changes to A386478. - N. J. A. Sloane, Jul 26 2025
STATUS
approved
