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.

A381770 a(n) is the least k > 0 such that the factorial base expansion of k*n has digits in nonincreasing order.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 2, 1, 5, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 6, 3, 2, 2, 3, 1, 2, 1, 1, 3, 3, 2, 3, 3, 2, 2, 14, 2, 2, 2, 2, 2, 2, 1, 6, 3, 2, 2, 8, 1, 2, 1, 1, 2, 2, 1, 5, 1, 1, 1, 1, 4, 8, 4, 6, 6, 8, 1, 6, 4, 2, 2, 9, 1, 8, 1, 1, 7, 8, 1, 5, 1]