The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A307025 Number of (undirected) paths in the m X n knight graph (triangle read by rows with m = 1..n and n = 1..). 0
 0, 0, 0, 0, 2, 56, 0, 4, 374, 14980, 0, 8, 2664, 302844, 19005336, 0, 12, 17556, 6530656, 1248702804, 278982789260, 0, 18, 121838, 151793054 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS Table of n, a(n) for n=1..25. Eric Weisstein's World of Mathematics, Graph Path Eric Weisstein's World of Mathematics, Knight Graph FORMULA a(1, n) = 0. a(2, n) = (1 - (-1)^n + 2*n*(n - 2))/4 for n > 1. a(n, n) = A288033(n). EXAMPLE 0; 0, 0; 0, 2, 56; 0, 4, 374, 14980; 0, 8, 2664, 302844, 19005336; 0, 12, 17556, 6530656, 1248702804, 278982789260; 0, 18, 121838, 151793054, ...; CROSSREFS Cf. A288033 (n X n knight graph). Sequence in context: A210928 A210932 A278842 * A037176 A045819 A281198 Adjacent sequences: A307022 A307023 A307024 * A307026 A307027 A307028 KEYWORD nonn,tabl,more AUTHOR Eric W. Weisstein, Mar 20 2019 STATUS approved

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

Last modified December 9 09:12 EST 2023. Contains 367690 sequences. (Running on oeis4.)