This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A114929 Array read by antidiagonals: consider a semi-infinite chessboard with squares labeled (i,j), i >= 0, j >= 0; T(i,j) = number of king-paths of length max{i,j} from (0,0) to (i,j). 3
 1, 1, 1, 2, 1, 2, 4, 2, 2, 4, 9, 5, 1, 5, 9, 21, 12, 3, 3, 12, 21, 51, 30, 9, 1, 9, 30, 51, 127, 76, 25, 4, 4, 25, 76, 127, 323, 196, 69, 14, 1, 14, 69, 196, 323, 835, 512, 189, 44, 5, 5, 44, 189, 512, 835, 2188, 1353, 518, 133, 20, 1, 20, 133, 518, 1353, 2188, 5798, 3610, 1422 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 REFERENCES Harrie Grondijs, Neverending Quest of Type C, Volume B - the endgame study-as-struggle. LINKS FORMULA Equals Motzkin triangle (A026300) next to same triangle reflected in mirror. See A026300 for the obvious recurrence. EXAMPLE Array begins: 1 1 2 4 9 21 51 ... 1 1 2 5 12 30 ... 2 2 1 3 9 25 ... 4 5 3 1 4 14 ... ... CROSSREFS Cf. A026300, A020474, A111808, A114972. Sequence in context: A270594 A270706 A082793 * A247321 A152251 A144025 Adjacent sequences:  A114926 A114927 A114928 * A114930 A114931 A114932 KEYWORD nonn,tabl,easy AUTHOR N. J. A. Sloane, based on May 27 2005 email from Harrie Grondijs, Feb 27 2006 EXTENSIONS More terms from Joshua Zucker, May 20 2006 T(0,0) corrected by Johannes W. Meijer, Oct 07 2010 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 18 07:00 EDT 2018. Contains 316307 sequences. (Running on oeis4.)