login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A226088 a(n) is the number of the distinct quadrilaterals in a regular n-gon, which Q3 type are excluded. 2

%I #26 Feb 11 2018 03:07:26

%S 0,1,1,3,4,8,10,15,19,26,31,39,46,56,64,75,85,98,109,123,136,152,166,

%T 183,199,218

%N a(n) is the number of the distinct quadrilaterals in a regular n-gon, which Q3 type are excluded.

%C From the drawings as shown in links, it can be separated the distinct quadrilaterals into 3 types:

%C Q1: Quadrilaterals which have at least one side equal to n-gon sides length.

%C Q2: Quadrilaterals which have at least one pair parallel sides and all sides are longer than n-gon sides length.

%C Q3: Quadrilaterals which have no parallel sides and all sides are longer than n-gon side length.

%C Q1(n) = A004652(n-3); Q2(n) = A001917(n-6), Q2(3) = 0, Q2(4) = 0; Q3(n) = A005232(n-10), Q3(3) = 0, Q3(4) = 0, Q3(5) = 0, Q3(6) = 0, Q3(7) = 0, Q3(8) = 0, Q3(9) = 0.

%C a(n) = Q1(n) + Q2(n). The total distinct quadrilaterals is Q1 + Q2 + Q3. Also the total distinct quadrilaterals = A005232(n-4), for n>=4. Also a(n) = A005232(n-4) - A005232(n-10), for n>=10.

%H Kival Ngaokrajang, <a href="/A226088/a226088.jpg">The distinct quadrilaterals for n = 4..9</a>

%H Kival Ngaokrajang, <a href="/A226088/a226088_2.jpg">The distinct quadrilaterals for n = 10</a>

%H Kival Ngaokrajang, <a href="/A226088/a226088_3.jpg">Q1 & Q2 for n = 23</a>

%H Kival Ngaokrajang, <a href="/A226088/a226088_4.jpg">Q3 for n = 23</a>

%F Empirical g.f.: -x^4*(x^2-x+1)^2*(x^2+x+1) / ((x-1)^3*(x+1)*(x^2+1)). - _Colin Barker_, Oct 31 2013

%e For a pentagon, there are 5 quadrilaterals which are the same size and shape. Therefore a(5) = 1.

%o (Small Basic)

%o Q2=0

%o For n = 3 To 50

%o Q1 = Math.Ceiling((n-3)*(n-3)/4) 'A004652(n-3)

%o If n > 4 Then

%o Q2 = Math.Round((n-6)*(n-6)/8) 'A001917(n-6)

%o EndIf

%o a = Q1 + Q2

%o TextWindow.Write(a +", ")

%o EndFor

%Y Cf. A004652, A001917, A005232, A001399: For n >= 3, a(n-3) is number of distinct triangles in an n-gon.

%K nonn,more

%O 3,4

%A _Kival Ngaokrajang_, May 25 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 19:48 EDT 2024. Contains 371754 sequences. (Running on oeis4.)