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.

A036476 a(n) = partition(11n+2) mod 11.

Table of values

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

List of values

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