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.

A119802 a(1) = 1. For m >= 0 and 1 <= k <= 2^m, a(2^m +k) = number of earlier terms of the sequence which equal a(k).

Table of values

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

List of values

[1, 1, 2, 2, 2, 2, 4, 4, 2, 2, 6, 6, 6, 6, 2, 2, 2, 2, 10, 10, 10, 10, 2, 2, 12, 12, 4, 4, 4, 4, 12, 12, 2, 2, 14, 14, 14, 14, 6, 6, 14, 14, 6, 7, 7, 7, 14, 14, 14, 14, 4, 4, 4, 4, 14, 14, 4, 4, 12, 12, 12, 12, 8, 8, 2, 2, 16, 16, 16, 16, 12, 12, 16, 16, 7, 7, 7, 7, 16, 16, 16, 16, 4, 4, 4, 4]