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.

A382278 a(n) = least integer m >= 2 such that n is a sum of the form Sum_{k>=0} floor(h/m^k) for some integer h >= 1.

Table of values

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

List of values

[2, 3, 2, 2, 3, 3, 2, 2, 3, 2, 2, 4, 3, 3, 2, 2, 3, 2, 2, 5, 3, 2, 2, 4, 2, 2, 3, 3, 4, 3, 2, 2, 4, 2, 2, 3, 4, 2, 2, 3, 2, 2, 4, 3, 3, 2, 2, 3, 2, 2, 5, 4, 2, 2, 3, 2, 2, 3, 3, 4, 3, 3, 2, 2, 4, 2, 2, 3, 4, 2, 2, 3, 2, 2, 3, 3, 5, 2, 2, 3, 2, 2, 5, 3, 2, 2]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.