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.

A117754 Triangle T(n, k) = (f(n, 1 + (n mod 3)) + f(k, 1 + (k mod 3))) mod n!, read by rows (see formula for f(n, k)).

Table of values

n a(n)
0 0
1 0
2 0
3 1
4 1
5 0
6 2
7 2
8 3
9 2
10 7
11 7
12 8
13 7
14 12
15 1
16 1
17 2
18 1
19 6
20 0
21 25
22 25
23 26
24 25
25 30
26 144
27 48
28 211
29 211
30 212
31 211
32 216
33 330
34 234
35 420
36 1
37 1
38 2
39 1
40 6
41 120
42 24
43 210
44 0
45 1729
46 1729
47 1730
48 1729
49 1734
50 1848
51 1752
52 1938
53 42048
54 3456
55 211
56 211
57 212
58 211
59 216
60 330
61 234
62 420
63 40530
64 1938
65 420

List of values

[0, 0, 0, 1, 1, 0, 2, 2, 3, 2, 7, 7, 8, 7, 12, 1, 1, 2, 1, 6, 0, 25, 25, 26, 25, 30, 144, 48, 211, 211, 212, 211, 216, 330, 234, 420, 1, 1, 2, 1, 6, 120, 24, 210, 0, 1729, 1729, 1730, 1729, 1734, 1848, 1752, 1938, 42048, 3456, 211, 211, 212, 211, 216, 330, 234, 420, 40530, 1938, 420]