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.

A087165 a(n)=1 when n == 1 (mod 4), otherwise a(n) = a(n - ceiling(n/4)) + 1. Removing all the 1's results in the original sequence with every term incremented by 1.

Table of values

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

List of values

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