login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A062106
Number of ways a black pawn (from any starting square on the second back rank) can (theoretically) end on the n-th square of the leftmost file counted from the back rank.
1
0, 1, 2, 6, 15, 40, 109, 302, 846, 2390, 6796, 19426, 55767, 160668, 464305, 1345282, 3906701, 11367696, 33135987, 96740610, 282831981, 827939880, 2426431239, 7118546874, 20904025380, 61439768166, 180725813478, 532004277518
(list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
Table of n, a(n) for n=1..28.
MAPLE
[seq(ChessPawnTriangle(j, 1), j=1..40)];
CROSSREFS
The left column of table A062104. Cf. also A062107.
Sequence in context: A307128 A172399 A001654 * A206000 A316981 A319560
Adjacent sequences: A062103 A062104 A062105 * A062107 A062108 A062109
KEYWORD
nonn
AUTHOR
Antti Karttunen, May 30 2001
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified March 9 19:04 EDT 2025. Contains 381603 sequences.
License Agreements, Terms of Use, Privacy Policy