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.

A097289 Contains exactly once every pair (i,j) satisfying 0 < i <= j.

Table of values

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

List of values

[1, 1, 2, 2, 1, 3, 3, 1, 4, 4, 2, 3, 1, 5, 5, 2, 4, 1, 6, 6, 2, 5, 3, 4, 1, 7, 7, 2, 6, 3, 5, 1, 8, 8, 2, 7, 3, 6, 4, 5, 1, 9, 9, 2, 8, 3, 7, 4, 6, 1, 10, 10, 2, 9, 3, 8, 4, 7, 5, 6, 1, 11, 11, 2, 10, 3, 9, 4, 8, 5, 7, 1, 12, 12, 2, 11, 3, 10, 4, 9, 5, 8, 6, 7, 1, 13, 13, 2, 12, 3, 11, 4, 10, 5, 9, 6, 8, 1]