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.

A025485 Number of iterations of function f(k) = ceiling(sqrt(k))^2 - k on n required to force n <= 2.

Table of values

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

List of values

[0, 0, 0, 1, 1, 2, 2, 1, 1, 1, 3, 3, 2, 2, 1, 1, 1, 2, 2, 3, 3, 2, 2, 1, 1, 1, 4, 2, 2, 2, 3, 3, 2, 2, 1, 1, 1, 3, 4, 4, 2, 2, 2, 3, 3, 2, 2, 1, 1, 1, 2, 3, 3, 4, 4, 2, 2, 2, 3, 3, 2, 2, 1, 1, 1, 2, 2, 2, 3, 3, 4, 4, 2, 2, 2, 3, 3, 2, 2, 1, 1, 1, 3, 3, 2, 2, 2, 3, 3, 4, 4, 2, 2, 2, 3, 3, 2, 2, 1, 1, 1, 4, 4, 3, 3, 2, 2, 2]