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.

A036483 a(n) = partition(11n+10) mod 11.

Table of values

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

List of values

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