login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(n) is the number of regions into which the plane is divided by n lines parallel to each edge of an equilateral triangle with side n such that the lines extend the parallel edge and divide the other edges into unit segments.
1

%I #41 Nov 24 2023 12:21:56

%S 7,16,30,49,73,102,136,175,219,268,322,381,445,514,588,667,751,840,

%T 934,1033,1137,1246,1360,1479,1603,1732,1866,2005,2149,2298,2452,2611,

%U 2775,2944,3118,3297,3481,3670,3864,4063,4267,4476,4690,4909,5133,5362,5596,5835,6079,6328

%N a(n) is the number of regions into which the plane is divided by n lines parallel to each edge of an equilateral triangle with side n such that the lines extend the parallel edge and divide the other edges into unit segments.

%C Detailed instructions for drawing the lines. Along the edges of an equilateral triangle with side n, points are marked that divide the edges into unit segments. Draw all infinite straight lines that connect those points and are parallel to the edges of the triangle. For n = 1..5, the link shows the construction of these lines.

%H Paolo Xausa, <a href="/A364352/b364352.txt">Table of n, a(n) for n = 1..10000</a>

%H Nicolay Avilov, <a href="/A364352/a364352.jpg">Illustration of initial terms</a>

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).

%F a(n) = n*(5*n + 3)/2 + 3;

%F a(n) = A147875(n) + 3 = A134238(n+1) + 2.

%F From _Stefano Spezia_, Nov 23 2023: (Start)

%F O.g.f.: x*(7 - 5*x + 3*x^2)/(1 - x)^3.

%F E.g.f.: exp(x)*(3 + 4*x + 5*x^2/2) - 3. (End)

%e a(1) = 1 + 3 + 3 = 7;

%e a(2) = 2^2 + 3*3 + 3 = 16;

%e a(5) = 5^2 + 3*9 + 3*6 + 3 = 73.

%t LinearRecurrence[{3,-3,1},{7,16,30},100] (* _Paolo Xausa_, Oct 16 2023 *)

%Y Cf. A134238, A147875, A177862, A343755, A364401.

%K nonn,easy

%O 1,1

%A _Nicolay Avilov_, Jul 20 2023

%E Edited by _Peter Munn_, Sep 02 2023