|
%I #13 Dec 28 2022 10:33:59
%S 2,5,10,17,34,61,98,145,202,269,346,433,530,637,754,881,1018,1165,
%T 1322,1489,1666,1853,2050,2257,2474,2701,2938,3185,3442,3709,3986,
%U 4273,4570,4877,5194,5521,5858,6205,6562,6929,7306,7693,8090,8497,8914,9341,9778,10225,10682,11149
%N Number of (not necessarily maximal) cliques in the n X n antelope graph.
%H Colin Barker, <a href="/A308600/b308600.txt">Table of n, a(n) for n = 1..1000</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/AntelopeGraph.html">Antelope Graph</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Clique.html">Clique</a>
%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (3,-3,1).
%F a(n) = 5*n^2-28*n+49 for n >= 3.
%F From _Colin Barker_, Jun 10 2019: (Start)
%F G.f.: x*(2 - x + x^2 + 8*x^4) / (1 - x)^3.
%F a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n>5.
%F (End)
%t Table[Piecewise[{{2, n == 1}, {5, n == 2}}, 49 - 28 n + 5 n^2], {n, 20}]
%o (PARI) Vec(x*(2 - x + x^2 + 8*x^4) / (1 - x)^3 + O(x^50)) \\ _Colin Barker_, Jun 10 2019
%K nonn,easy
%O 1,1
%A _Eric W. Weisstein_, Jun 09 2019
|
