This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A251418 #23 Sep 08 2022 08:46:10 %S A251418 -2,-2,-1,0,1,2,3,5,6,8,10,12,14,16,19,21,24,27,30,33,36,40,43,47,51, %T A251418 55,59,63,68,72,77,82,87,92,97,103,108,114,120,126,132,138,145,151, %U A251418 158,165,172,179,186,194,201,209,217,225,233,241,250,258,267,276 %N A251418 Floor((n^2+7n-23)/14). %C A251418 This is conjectured to be the value of the dominance number of the triangle grid graph for n >= 14 - see A251419. %H A251418 Colin Barker, <a href="/A251418/b251418.txt">Table of n, a(n) for n = 0..1000</a> %H A251418 Stan Wagon, <a href="http://www.jstor.org/stable/10.4169/college.math.j.45.4.278">Graph Theory Problems from Hexagonal and Traditional Chess</a>, The College Mathematics Journal, Vol. 45, No. 4, September 2014 pp. 278-287. %H A251418 <a href="/index/Rec#order_09">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1,0,0,0,0,1,-2,1). %F A251418 G.f.: (3*x^8-3*x^7-x^2-2*x+2) / ((x-1)^3*(x^6+x^5+x^4+x^3+x^2+x+1)). - _Colin Barker_, Jul 10 2015 %t A251418 Table[Floor[(n^2 + 7 n - 23) / 14], {n, 0, 80}] (* _Vincenzo Librandi_, Dec 04 2014 *) %t A251418 LinearRecurrence[{2,-1,0,0,0,0,1,-2,1},{-2,-2,-1,0,1,2,3,5,6},60] (* _Harvey P. Dale_, Mar 19 2020 *) %o A251418 (Magma) [Floor((n^2+7*n-23)/14): n in [0..60]]; // _Vincenzo Librandi_, Dec 04 2014 %o A251418 (PARI) Vec((3*x^8-3*x^7-x^2-2*x+2)/((x-1)^3*(x^6+x^5+x^4+x^3+x^2+x+1)) + O(x^100)) \\ _Colin Barker_, Jul 10 2015 %Y A251418 Cf. A251419. %K A251418 sign,easy %O A251418 0,1 %A A251418 _N. J. A. Sloane_, Dec 04 2014 %E A251418 More terms from _Vincenzo Librandi_, Dec 04 2014