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.

A255824 a(n) = n for n < 4; a(4n) = a(n); if every 4th term (a(4), a(8), a(12), ...) is deleted, this gives back the original sequence.

Table of values

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

List of values

[1, 2, 3, 1, 1, 1, 1, 2, 1, 2, 1, 3, 2, 1, 3, 1, 2, 1, 3, 1, 1, 2, 1, 1, 3, 1, 1, 1, 2, 1, 1, 2, 3, 1, 1, 1, 1, 2, 1, 2, 1, 2, 3, 1, 1, 1, 1, 3, 1, 2, 1, 2, 2, 1, 2, 1, 3, 1, 1, 3, 1, 1, 3, 1, 1, 2, 1, 2, 2, 2, 1, 1, 2, 1, 3, 3, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 2, 2, 1, 2, 2, 1, 2, 1, 1, 1, 2, 1, 3, 3]