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.

A133891 a(n) = binomial(n+p,n) mod p, where p=12.

Table of values

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

List of values

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