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.

A036478 a(n) = partition(11n+4) mod 11.

Table of values

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

List of values

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