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.

A036485 a(n) = partition(11n) mod 11.

Table of values

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

List of values

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