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.

A348090 Place the numbers 1 to n on a square grid and sum both numbers in all created orthogonally adjacent pairs; a(n) gives the maximum possible value of the sum of all pair sums.

Table of values

n a(n)
1 0
2 3
3 9
4 20
5 34
6 53
7 75
8 101
9 134
10 168
11 204
12 247
13 293
14 344
15 399
16 456
17 518
18 585
19 654
20 725
21 803
22 886
23 978
24 1065
25 1154
26 1252
27 1355
28 1467
29 1572
30 1679
31 1797
32 1920
33 2052
34 2188
35 2315
36 2444
37 2586
38 2733
39 2889
40 3049
41 3198
42 3349
43 3515
44 3686
45 3866
46 4050
47 4238
48 4413
49 4590
50 4784
51 4983
52 5191
53 5403
54 5619

List of values

[0, 3, 9, 20, 34, 53, 75, 101, 134, 168, 204, 247, 293, 344, 399, 456, 518, 585, 654, 725, 803, 886, 978, 1065, 1154, 1252, 1355, 1467, 1572, 1679, 1797, 1920, 2052, 2188, 2315, 2444, 2586, 2733, 2889, 3049, 3198, 3349, 3515, 3686, 3866, 4050, 4238, 4413, 4590, 4784, 4983, 5191, 5403, 5619]