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.

A036481 a(n) = partition(11n+8) mod 11.

Table of values

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

List of values

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