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.

A036480 a(n) = partition(11n+7) mod 11.

Table of values

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

List of values

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