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.

A375001 Square array read by antidiagonals: T(n,k) is the position of the last requested element 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 >= 0, k >= 1.

Table of values

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

List of values

[1, 2, 1, 1, 2, 1, 3, 1, 2, 1, 1, 3, 1, 2, 1, 2, 2, 3, 1, 2, 1, 1, 2, 2, 3, 1, 2, 1, 4, 1, 2, 2, 3, 1, 2, 1, 1, 4, 1, 2, 2, 3, 1, 2, 1, 2, 1, 4, 1, 2, 2, 3, 1, 2, 1, 1, 1, 2, 4, 1, 2, 2, 3, 1, 2, 1, 3, 1, 1, 2, 4, 1, 2, 2, 3, 1, 2, 1, 1, 3, 1, 1, 2, 4, 1, 2, 2, 3, 1, 2, 1]