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.

A284750 a(n) = least k > 0 such that k * n in factorial base representation contains only 0's and 1's.

Table of values

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

List of values

[1, 1, 1, 2, 5, 1, 1, 1, 1, 3, 3, 2, 2, 9, 2, 2, 9, 7, 8, 6, 6, 33, 256, 1, 1, 1, 1, 26, 5, 1, 1, 1, 1, 149, 24, 4, 159, 4, 130, 3, 3, 3, 3, 118, 16, 128, 16, 3, 3, 3, 3, 14, 16, 16, 840, 13, 89, 15, 88, 2, 2, 12, 2, 2, 78, 11, 13, 76, 597, 12, 71, 2, 2, 555, 2]