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.

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

Table of values

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

List of values

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