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.

A036482 a(n) = partition(11n+9) mod 11.

Table of values

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

List of values

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