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.

A171746 Let f(n) = n + floor(sqrt(n)). Then a(n) is the smallest number of iterations of f on n such that a perfect square is obtained.

Table of values

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

List of values

[3, 2, 1, 5, 2, 4, 1, 3, 7, 2, 4, 6, 1, 3, 5, 9, 2, 4, 6, 8, 1, 3, 5, 7, 11, 2, 4, 6, 8, 10, 1, 3, 5, 7, 9, 13, 2, 4, 6, 8, 10, 12, 1, 3, 5, 7, 9, 11, 15, 2, 4, 6, 8, 10, 12, 14, 1, 3, 5, 7, 9, 11, 13, 17, 2, 4, 6, 8, 10, 12, 14, 16, 1, 3, 5, 7, 9, 11, 13, 15, 19, 2, 4, 6, 8, 10, 12, 14, 16, 18, 1, 3, 5]