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.

A374996 Square array read by antidiagonals: T(n,k) is the total cost when the elements of the k-th composition (in standard order) are requested from a self-organizing list initialized to (1, 2, 3, ...), using the move-ahead(n) updating strategy; n, k >= 0.

Table of values

n a(n)
0 0
1 1
2 0
3 2
4 1
5 0
6 2
7 2
8 1
9 0
10 3
11 2
12 2
13 1
14 0
15 3
16 3
17 2
18 2
19 1
20 0
21 3
22 4
23 3
24 2
25 2
26 1
27 0
28 3
29 3
30 4
31 3
32 2
33 2
34 1
35 0
36 4
37 3
38 3
39 4
40 3
41 2
42 2
43 1
44 0
45 4
46 4
47 3
48 3
49 4
50 3
51 2
52 2
53 1
54 0
55 4
56 4
57 4
58 3
59 3
60 4
61 3
62 2
63 2
64 1
65 0
66 4
67 3
68 5
69 4
70 3
71 3
72 4
73 3
74 2
75 2
76 1
77 0
78 4
79 5
80 3
81 5
82 4
83 3
84 3
85 4
86 3
87 2
88 2
89 1
90 0

List of values

[0, 1, 0, 2, 1, 0, 2, 2, 1, 0, 3, 2, 2, 1, 0, 3, 3, 2, 2, 1, 0, 3, 4, 3, 2, 2, 1, 0, 3, 3, 4, 3, 2, 2, 1, 0, 4, 3, 3, 4, 3, 2, 2, 1, 0, 4, 4, 3, 3, 4, 3, 2, 2, 1, 0, 4, 4, 4, 3, 3, 4, 3, 2, 2, 1, 0, 4, 3, 5, 4, 3, 3, 4, 3, 2, 2, 1, 0, 4, 5, 3, 5, 4, 3, 3, 4, 3, 2, 2, 1, 0]