|
%I #7 Sep 07 2015 13:31:01
%S 0,0,1,12,29,27,80,125,108,260,356,300,637,832,675,1341,1665,1323,
%T 2500,3025,2352,4304,5072,3888,6929,8036,6075,10625,12125,9075,15616,
%U 17629,13068,22212,24804,18252,30685,34000,24843,41405,45521
%N In triangular peg solitaire, number of distinct solvable feasible pairs starting with one peg missing and finishing with one peg.
%C Coincides with A130515 for n >= 6.
%H George I. Bell, <a href="/A130516/b130516.txt">Table of n, a(n) for n = 2..52</a>
%H George I. Bell, <a href="http://arXiv.org/abs/math.CO/0703865">Solving Triangular Peg Solitaire</a> [arXiv:math/0703865v4]
%H G. I. Bell, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL11/Bell/bell2.html">Solving Triangular Peg Solitaire</a>, JIS 11 (2008) 08.4.8
%F Reference gives an explicit formula for a(n).
%Y Cf. A130515.
%K nonn
%O 2,4
%A _N. J. A. Sloane_, Aug 09 2007
%E More terms from George I. Bell (gibell(AT)comcast.net), Sep 27 2007
|
