cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A047880 a(n) = A047879(n) / 2.

Original entry on oeis.org

0, 5, 5, 9, 12, 19, 25, 35, 41, 54, 63, 78, 88, 106, 118, 139, 152, 175, 191, 217, 233, 262, 281, 312, 332, 366, 388, 425, 448, 487, 513, 555, 581, 626, 655, 702, 732, 782, 814, 867, 900, 955, 991, 1049, 1085, 1146, 1185, 1248, 1288
Offset: 0

Views

Author

Clark Kimberling

Keywords

Extensions

Name corrected by Sean A. Irvine, May 23 2021

A047881 a(n) = Sum_{h=0..n, k=0..n} T(h,k), array T counting knights' moves as in A049604.

Original entry on oeis.org

0, 10, 20, 38, 62, 100, 150, 220, 302, 410, 536, 692, 868, 1080, 1316, 1594, 1898, 2248, 2630, 3064, 3530, 4054, 4616, 5240, 5904, 6636, 7412, 8262, 9158, 10132, 11158, 12268, 13430, 14682, 15992, 17396, 18860, 20424, 22052
Offset: 0

Views

Author

Clark Kimberling

Keywords

Crossrefs

Partial sums of A047879.

Formula

Conjecture: a(n) = a(n-1) + a(n-2) - 2*a(n-5) + a(n-8) + a(n-9) - a(n-10) for n > 11. - Chai Wah Wu, May 25 2016
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.