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.

A265890 Array read by ascending antidiagonals: A(n,k) = A099563(A265609(n,k)), with n as row >= 0, k as column >= 0; the most significant digit in the factorial base representation of rising factorial n^(k) = (n+k-1)!/(n-1)!.

Table of values

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

List of values

[1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 2, 2, 1, 1, 0, 1, 2, 3, 2, 1, 1, 0, 1, 1, 1, 1, 3, 1, 1, 0, 1, 1, 1, 1, 1, 3, 1, 1, 0, 1, 1, 2, 2, 2, 1, 4, 1, 1, 0, 1, 1, 3, 4, 4, 3, 1, 4, 1, 1, 0, 1, 1, 3, 1, 1, 6, 3, 1, 5, 1, 1, 0, 1, 1, 4, 1, 1, 1, 8, 4, 1, 5, 1, 1, 0, 1, 2, 1, 1, 2, 2, 1, 1, 5, 2, 6, 1, 1, 0, 1, 2, 1, 2, 3, 3, 3, 2, 1, 6, 2, 6, 1, 1, 0]