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.

A353434 Array read by descending antidiagonals: T(n,m) is the number of sequences of length n >= 0 with elements in 1..m-1 such that no iterated difference is divisible by m >= 1.

Table of values

n a(n)
0 1
1 1
2 0
3 1
4 1
5 0
6 1
7 2
8 0
9 0
10 1
11 3
12 2
13 0
14 0
15 1
16 4
17 6
18 2
19 0
20 0
21 1
22 5
23 12
24 8
25 2
26 0
27 0
28 1
29 6
30 20
31 28
32 6
33 2
34 0
35 0
36 1
37 7
38 30
39 64
40 48
41 6
42 2
43 0
44 0
45 1
46 8
47 42
48 126
49 164
50 60
51 6
52 2
53 0
54 0
55 1
56 9
57 56
58 216
59 444
60 336
61 60
62 6
63 2
64 0
65 0
66 1
67 10
68 72
69 344
70 954
71 1350
72 552
73 52
74 6
75 2
76 0
77 0

List of values

[1, 1, 0, 1, 1, 0, 1, 2, 0, 0, 1, 3, 2, 0, 0, 1, 4, 6, 2, 0, 0, 1, 5, 12, 8, 2, 0, 0, 1, 6, 20, 28, 6, 2, 0, 0, 1, 7, 30, 64, 48, 6, 2, 0, 0, 1, 8, 42, 126, 164, 60, 6, 2, 0, 0, 1, 9, 56, 216, 444, 336, 60, 6, 2, 0, 0, 1, 10, 72, 344, 954, 1350, 552, 52, 6, 2, 0, 0]