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.

A081753 a(n) = floor(n/12) if n == 2 (mod 12); a(n) = floor(n/12) + 1 otherwise.

Table of values

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

List of values

[1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 8, 9, 9, 9, 9, 9, 9]