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.

A156344 Number of steps to reach a square starting from n and iterating the map: x -> x*ceiling(sqrt(x))/floor(sqrt(x)) or zero if no square is reached.

Table of values

n a(n)
1 1
2 2
3 3
4 1
5 6
6 2
7 9
8 3
9 1
10 14
11 103
12 2
13 19
14 7
15 3
16 1
17 26
18 10
19 105
20 2
21 33
22 13
23 312
24 3
25 1
26 42
27 691
28 241
29 27190
30 2
31 51
32 21
33 11
34 260
35 3
36 1
37 62
38 26
39 14
40 8
41 151
42 2
43 73
44 31
45 17
46 492
47 268
48 3
49 1
50 86
51 2535
52 869
53 315546
54 1065
55 183
56 2
57 99
58 43
59 2226
60 15
61 350
62 294
63 3
64 1
65 114
66 50
67 1457
68 18

List of values

[1, 2, 3, 1, 6, 2, 9, 3, 1, 14, 103, 2, 19, 7, 3, 1, 26, 10, 105, 2, 33, 13, 312, 3, 1, 42, 691, 241, 27190, 2, 51, 21, 11, 260, 3, 1, 62, 26, 14, 8, 151, 2, 73, 31, 17, 492, 268, 3, 1, 86, 2535, 869, 315546, 1065, 183, 2, 99, 43, 2226, 15, 350, 294, 3, 1, 114, 50, 1457, 18]