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.

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

List of values

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

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

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