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.

A088003 Take the list t(n,0) = {1,...,n}; denote by t(n,j) this list after rotating to left (or right) by j positions. Calculate inner product of t(n,0) and t(n,j) and denote the value by s(n,j). Compute this inner product for all j = 1..n and choose the smallest. This is a(n).

Table of values

n a(n)
1 1
2 4
3 11
4 22
5 40
6 64
7 98
8 140
9 195
10 260
11 341
12 434
13 546
14 672
15 820
16 984
17 1173
18 1380
19 1615
20 1870
21 2156
22 2464
23 2806
24 3172
25 3575
26 4004
27 4473
28 4970
29 5510
30 6080
31 6696
32 7344
33 8041
34 8772
35 9555
36 10374
37 11248
38 12160
39 13130
40 14140
41 15211
42 16324
43 17501
44 18722
45 20010

List of values

[1, 4, 11, 22, 40, 64, 98, 140, 195, 260, 341, 434, 546, 672, 820, 984, 1173, 1380, 1615, 1870, 2156, 2464, 2806, 3172, 3575, 4004, 4473, 4970, 5510, 6080, 6696, 7344, 8041, 8772, 9555, 10374, 11248, 12160, 13130, 14140, 15211, 16324, 17501, 18722, 20010]