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.

A363193 a(1)=1, and thereafter a(n) = number of occurrences of a(k) among terms a(1..k), where k = n-a(n-1).

Table of values

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

List of values

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