Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A057790
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A057790 Triangle read by rows: T(n,k) = number of knight's walks (n >= 0, k >= 0). +0
1
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 3, 2, 3, 1, 1, 1, 1, 3, 4, 4, 3, 1, 1, 1, 1, 5, 5, 6, 5, 5, 1, 1, 1, 1, 6, 7, 10, 10, 7, 6, 1, 1, 1, 1, 8, 11, 16, 14, 16, 11, 8, 1, 1, 1, 1, 12, 17, 22, 27, 27, 22, 17, 12, 1, 1, 1, 1, 18, 23, 39, 44, 44, 44, 39, 23, 18, 1, 1, 1, 1 (list; table; graph; listen)
page 1

Search completed in 0.001 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 December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research