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.

A306536 The smallest integer k such that floor((2*n)^k/k) is an odd number.

Table of values

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

List of values

[12, 3, 5, 5, 3, 7, 10, 3, 5, 11, 3, 7, 5, 3, 17, 12, 3, 5, 5, 3, 11, 10, 3, 5, 7, 3, 7, 5, 3, 11, 11, 3, 5, 5, 3, 13, 10, 3, 5, 7, 3, 10, 5, 3, 17, 7, 3, 5, 5, 3, 11, 10, 3, 5, 7, 3, 10, 5, 3, 7, 7, 3, 5, 5, 3, 15, 7, 3, 5, 12, 3, 10, 5, 3, 7]