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.

A036479 a(n) = partition(11n+5) mod 11.

Table of values

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

List of values

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.