This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A297741 The number of distinct positions on an infinite chessboard reachable by the (3,4)-leaper in <= n moves. 2
 1, 9, 41, 129, 321, 681, 1289, 2121, 3081, 4121, 5233, 6445, 7777, 9233, 10813, 12517, 14345, 16297, 18373, 20573, 22897, 25345, 27917, 30613, 33433, 36377, 39445, 42637, 45953, 49393, 52957, 56645, 60457, 64393, 68453, 72637, 76945, 81377, 85933, 90613, 95417 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS FORMULA Conjecture: a(n) = 62*n^2 + 30*n - 55 for n >= 10. Conjectures from Colin Barker, Jan 06 2018: (Start) G.f.: (1 + 6*x + 17*x^2 + 32*x^3 + 48*x^4 + 64*x^5 + 80*x^6 - 24*x^7 - 96*x^8 - 48*x^9 - 8*x^10 + 28*x^11 + 20*x^12 + 4*x^13) / (1 - x)^3. a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n>13. (End) CROSSREFS Cf. A018836 (1,2)-leaper or (1,3)-leaper, A297740 (2,3)-leaper. Sequence in context: A245932 A274323 A297740 * A001846 A271663 A034441 Adjacent sequences:  A297738 A297739 A297740 * A297742 A297743 A297744 KEYWORD nonn AUTHOR R. J. Mathar, Jan 05 2018 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 17 10:29 EST 2019. Contains 319218 sequences. (Running on oeis4.)