[go: up one dir, main page]

login
Revision History for A350561 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
a(n) is the number of ways of making n moves in English Peg Solitaire.
(history; published version)
#30 by N. J. A. Sloane at Tue Feb 22 00:39:56 EST 2022
STATUS

proposed

approved

#29 by Jon E. Schoenfield at Fri Jan 28 18:30:23 EST 2022
STATUS

editing

proposed

#28 by Jon E. Schoenfield at Fri Jan 28 18:27:55 EST 2022
EXAMPLE

Given the positions marked thus,:

a b c

d e f

abcg h i j k l m

defn o p q r s t

ghijklm

nopqrst

uvwxyz0

123u v w x y z 0

456

1 2 3

4 5 6

There there are 12 ways to make two moves, viz.,

(1) e jumps over j, then h jumps over i;

(2) e jumps over j, then x jumps over q;

(3) e jumps over j, then l jumps over k;

(4) o jumps over p, then d jumps over i;

(5) o jumps over p, then 1 jumps over w;

(6) o jumps over p, then r jumps over q;

(7) 2 jumps over x, then j jumps over q;

(8) 2 jumps over x, then v jumps over w;

(9) 2 jumps over x, then z jumps over y;

(10) s jumps over r, then f jumps over k;

(11) s jumps over r, then p jumps over q;

(12) s jumps over r, then 3 jumps over y.

STATUS

proposed

editing

#27 by Andrew Howroyd at Fri Jan 28 16:43:39 EST 2022
STATUS

editing

proposed

#26 by Andrew Howroyd at Fri Jan 28 16:43:30 EST 2022
CROSSREFS
STATUS

proposed

editing

#25 by Douglas Boffey at Fri Jan 28 16:15:30 EST 2022
STATUS

editing

proposed

#24 by Douglas Boffey at Fri Jan 28 16:15:15 EST 2022
DATA

1, 4, 12, 60, 400, 2960, 24600, 221072, 2076744, 20123080, 197757768, 1937125160, 18687793880, 175793675328, 1594744777464, 13794351556920, 112576101214496, 857945953884624, 6037935953538456, 38729529837059648, 222984258240522544, 1133096911619304064, 4985812137371331624

OFFSET

1,1

0,2

COMMENTS

This sequence has 32 terms in total.

KEYWORD

nonn,changed,fini

STATUS

proposed

editing

#23 by Andrew Howroyd at Fri Jan 28 14:37:31 EST 2022
STATUS

editing

proposed

Discussion
Fri Jan 28
14:38
Andrew Howroyd: a(0)=1 should also be prepended (see A335656). Please add a Comment to say how many terms.
#22 by Andrew Howroyd at Fri Jan 28 14:35:51 EST 2022
NAME

Aa(n) is the number of ways of making n moves in English Peg Solitaire.

CROSSREFS

Cf. A335656.

STATUS

proposed

editing

Discussion
Fri Jan 28
14:37
Andrew Howroyd: Should be a(n) not A(n). I take it this is finite and when completed will have 31 terms as A335656? If so the 'fini' keyword should be added to Keywords.
#21 by Douglas Boffey at Fri Jan 28 14:29:35 EST 2022
STATUS

editing

proposed