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.

A230415 Square array T(i,j) giving the number of differing digits in the factorial base representations of i and j, for i >= 0, j >= 0, read by antidiagonals.

Table of values

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

List of values

[0, 1, 1, 1, 0, 1, 2, 2, 2, 2, 1, 1, 0, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 1, 0, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 1, 0, 1, 2, 1, 2, 3, 3, 3, 3, 1, 1, 3, 3, 3, 3, 2, 2, 1, 2, 2, 0, 2, 2, 1, 2, 2, 3, 3, 2, 2, 3, 3, 3, 3, 2, 2, 3, 3, 1, 2, 2, 1, 2, 2, 0, 2, 2, 1, 2, 2, 1, 2, 2, 3, 3, 3, 3, 1, 1, 3, 3, 3, 3, 2, 2, 2, 1, 2, 2, 1, 2, 1, 0, 1, 2, 1, 2, 2, 1, 2]