id:A130516 - OEIS Search Results

Search: id:A130516

Displaying 1-1 of 1 results found.

page 1

In triangular peg solitaire, number of distinct solvable feasible pairs starting with one peg missing and finishing with one peg.

+0
2

0, 0, 1, 12, 29, 27, 80, 125, 108, 260, 356, 300, 637, 832, 675, 1341, 1665, 1323, 2500, 3025, 2352, 4304, 5072, 3888, 6929, 8036, 6075, 10625, 12125, 9075, 15616, 17629, 13068, 22212, 24804, 18252, 30685, 34000, 24843, 41405, 45521 (list; graph; listen)

	OFFSET	`2,4`
	COMMENT	`Coincides with A130515 for n >= 6.`
	LINKS	`George I. Bell, Table of n, a(n) for n = 2..52` `George I. Bell, Solving Triangular Peg Solitaire [arXiv:math/0703865v4]`
	FORMULA	`Reference gives an explicit formula for a(n).`
	CROSSREFS	`Cf. A130515.` `Sequence in context: A043969 A078441 A000546 this_sequence A045554 A049725 A050689` `Adjacent sequences: A130513 A130514 A130515 this_sequence A130517 A130518 A130519`
	KEYWORD	`nonn`
	AUTHOR	`njas, Aug 09 2007`
	EXTENSIONS	`More terms from George I. Bell (gibell(AT)comcast.net), Sep 27 2007`

page 1

Search completed in 0.002 seconds

Last modified December 2 15:58 EST 2008. Contains 150992 sequences.

AT&T Labs Research