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.

A036475 a(n) = partition(11n+1) mod 11.

Table of values

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

List of values

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