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.

A317359 a(0) = 0, a(1) = 1; for n >= 2, a(n) = freq(a(n-g(n)),n) where g = A000523 and freq(i, j) is the number of times i appears in the terms a(0) .. a(j-1).

Table of values

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

List of values

[0, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 3, 3, 3, 3, 8, 8, 8, 8, 4, 4, 4, 4, 7, 7, 7, 7, 4, 4, 4, 4, 4, 12, 12, 12, 12, 12, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 11, 11, 11, 11, 11, 5, 5, 5, 5, 5, 5, 17, 17, 17, 17, 17, 17, 6, 6, 6, 6, 6, 6, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11]