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.

A036477 a(n) = partition(11n+3) mod 11.

Table of values

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

List of values

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