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.

A297740 The number of distinct positions on an infinite chessboard reachable by the (2,3)-leaper in <= n moves.

Table of values

n a(n)
0 1
1 9
2 41
3 129
4 321
5 625
6 997
7 1413
8 1885
9 2425
10 3033
11 3709
12 4453
13 5265
14 6145
15 7093
16 8109
17 9193
18 10345
19 11565
20 12853
21 14209
22 15633
23 17125
24 18685
25 20313
26 22009
27 23773
28 25605
29 27505
30 29473
31 31509
32 33613
33 35785
34 38025
35 40333
36 42709
37 45153
38 47665
39 50245
40 52893

List of values

[1, 9, 41, 129, 321, 625, 997, 1413, 1885, 2425, 3033, 3709, 4453, 5265, 6145, 7093, 8109, 9193, 10345, 11565, 12853, 14209, 15633, 17125, 18685, 20313, 22009, 23773, 25605, 27505, 29473, 31509, 33613, 35785, 38025, 40333, 42709, 45153, 47665, 50245, 52893]