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.

A381054 a(n) is the least k such that floor(sqrt(n*k/d(n*k))) - floor(sqrt(d(n*k))) = 1, where d(k) is the largest divisor of k which is <= sqrt(k).

Table of values

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

List of values

[5, 4, 4, 2, 1, 2, 1, 1, 2, 1, 4, 1, 4, 1, 1, 5, 9, 1, 9, 3, 1, 2, 9, 3, 2, 2, 2, 3, 16, 2, 16, 3, 2, 5, 2, 2, 25, 5, 2, 2, 25, 2, 25, 1, 1, 5, 25, 2, 2, 1, 3, 1, 36, 1, 1, 2, 3, 8, 36, 1, 36, 8, 1, 3, 1, 1, 49, 3, 3, 1, 49, 1, 49, 13, 1, 3, 1, 1, 49, 1]