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.

A265892 Array read by ascending antidiagonals: A(n,k) = A265893(A265609(n,k)), with n as row >= 0, k as column >= 0; the number of significant digits counted without trailing zeros 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 2
12 1
13 1
14 0
15 1
16 1
17 1
18 1
19 1
20 0
21 1
22 2
23 2
24 2
25 1
26 1
27 0
28 1
29 1
30 2
31 1
32 1
33 1
34 1
35 0
36 1
37 3
38 2
39 3
40 2
41 2
42 1
43 1
44 0
45 1
46 2
47 3
48 2
49 2
50 3
51 1
52 1
53 1
54 0
55 1
56 3
57 1
58 2
59 3
60 1
61 2
62 2
63 1
64 1
65 0
66 1
67 2
68 2
69 1
70 1
71 1
72 2
73 2
74 1
75 1
76 1
77 0
78 1
79 3
80 3
81 4
82 2
83 2
84 2
85 3
86 3
87 2
88 1
89 1
90 0
91 1
92 1
93 3
94 2
95 3
96 3
97 3
98 2
99 2
100 1
101 1
102 1
103 1
104 0
105 1
106 3
107 3
108 4
109 3
110 4
111 4
112 4
113 3
114 3
115 2
116 2
117 1
118 1
119 0

List of values

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