In triangular peg solitaire, number of distinct solvable feasible pairs starting with one peg missing and finishing with one peg.
A130516
In triangular peg solitaire, number of distinct solvable feasible pairs starting with one peg missing and finishing with one peg.
Terms
- a(0) =0a(1) =0a(2) =1a(3) =12a(4) =29a(5) =27a(6) =80a(7) =125a(8) =108a(9) =260a(10) =356a(11) =300a(12) =637a(13) =832a(14) =675a(15) =1341a(16) =1665a(17) =1323a(18) =2500a(19) =3025a(20) =2352a(21) =4304a(22) =5072a(23) =3888a(24) =6929a(25) =8036a(26) =6075a(27) =10625a(28) =12125a(29) =9075
External references
- oeis: A130516