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.

A215894 a(n) = floor(2^n / n^k), where k is the largest integer such that 2^n >= n^k.

Table of values

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

List of values

[1, 2, 1, 1, 1, 2, 4, 6, 1, 1, 2, 3, 5, 9, 1, 1, 2, 4, 6, 10, 17, 1, 2, 3, 5, 9, 15, 26, 1, 2, 4, 6, 11, 18, 31, 1, 2, 4, 6, 11, 19, 32, 1, 2, 3, 5, 9, 16, 28, 49, 1, 2, 4, 7, 13, 22, 38, 1, 1, 3, 5, 9, 16, 27, 47, 1, 2, 3, 5, 10, 17, 30, 51, 1, 2, 3, 5, 10]