Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A062106
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
2
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; listen)
OFFSET

1,3

MAPLE

[seq(ChessPawnTriangle(j, 1), j=1..40)];

CROSSREFS

The left column of table A062104. Cf. also A062107.

Sequence in context: A121331 A026270 A001654 this_sequence A061322 A004664 A074446

Adjacent sequences: A062103 A062104 A062105 this_sequence A062107 A062108 A062109

KEYWORD

nonn

AUTHOR

Antti Karttunen May 30 2001

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research