A261952 - cp's OEIS frontend

A261952 Start with a single equilateral triangle for n=0; for the odd n-th generation add a triangle at each expandable vertex of the triangles of the (n-1)-th generation (this is the "vertex to vertex" version); for the even n-th generation use the "side to side" version; a(n) is the number of triangles added in the n-th generation.

%I A261952 #18 Sep 14 2015 17:10:32
%S A261952 1,3,9,18,18,24,27,33,36,42,45,51,54,60,63,69,72,78,81,87,90,96,99,
%T A261952 105,108,114,117,123,126,132,135,141,144,150,153,159,162,168,171,177,
%U A261952 180,186,189,195,198,204,207,213,216,222
%N A261952 Start with a single equilateral triangle for n=0; for the odd n-th generation add a triangle at each expandable vertex of the triangles of the (n-1)-th generation (this is the "vertex to vertex" version); for the even n-th generation use the "side to side" version; a(n) is the number of triangles added in the n-th generation.
%C A261952 See a comment on V-V and V-S at A249246.
%C A261952 There are a total of 16 combinations as shown in the table below:
%C A261952 +-------------------------------------------------------+
%C A261952 | Even n-th version    V-V      S-V      V-S      S-S   |
%C A261952 +-------------------------------------------------------+
%C A261952 | Odd n-th  version                                     |
%C A261952 |      V-V           A008486  A248969  A261951    a(n)  |
%C A261952 |      S-V           A261950  A008486  A008486  A261956 |
%C A261952 |      V-S           A249246  A008486  A008486  A261957 |
%C A261952 |      S-S           A261953  A261954  A261955  A008486 |
%C A261952 +-------------------------------------------------------+
%C A261952 Note: V-V = vertex to vertex, S-V = side to vertex,
%C A261952       V-S = vertex to side,   S-S = side to side.
%C A261952 For n > 4, a(n) = A245094(n+1).
%H A261952 Kival Ngaokrajang, <a href="/A261952/a261952.pdf">Illustration of initial terms</a>
%F A261952 Conjectures from _Colin Barker_, Sep 10 2015: (Start)
%F A261952 a(n) = 3*(1-(-1)^n+6*n)/4 for n>3.
%F A261952 a(n) = a(n-1)+a(n-2)-a(n-3) for n>6.
%F A261952 G.f.: (3*x^6-3*x^5-6*x^4+7*x^3+5*x^2+2*x+1) / ((x-1)^2*(x+1)).
%F A261952 (End)
%o A261952 (PARI) {a=18; print1("1, 3, 9, 18, ", a, ", "); for(n=5, 100, if (Mod(n,2)==0, a=a+3, a=a+6); print1(a, ", "))}
%Y A261952 Cf. A008486, A248969, A249246, A245094.
%K A261952 nonn
%O A261952 0,2
%A A261952 _Kival Ngaokrajang_, Sep 06 2015

cp's OEIS Frontend