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.

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

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 0, 1, 1, 2, 2, 0, 1, 1, 4, 0, 2, 0, 1, 1, 2, 12, 0, 2, 0, 1, 1, 6, 0, 28, 0, 2, 0, 1, 1, 4, 30, 0, 48, 0, 2, 0, 1, 1, 6, 0, 126, 0, 60, 0, 2, 0, 1, 1, 4, 18, 0, 444, 0, 60, 0, 2, 0, 1, 1, 10, 0, 54, 0, 1350, 0, 52, 0, 2, 0, 1]