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.

A326823 a(n) is the number of iterations needed to reach 1 or 11 starting at n and using the map k -> (k/2 if k is even, otherwise k + (smallest square > k)). Set a(n) = -1 if the trajectory never reaches 1 or 11.

Table of values

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

List of values

[0, 1, 6, 2, 7, 7, 5, 3, 17, 8, 0, 8, 21, 6, 21, 4, 15, 18, 3, 9, 13, 1, 11, 9, 16, 22, 16, 7, 20, 22, 20, 5, 10, 16, 8, 19, 16, 4, 4, 10, 16, 14, 14, 2, 14, 12, 12, 10, 31, 17, 38, 23, 29, 17, 27, 8, 34, 21, 34, 23, 15, 21, 15, 6, 19, 11, 19, 17, 9, 9, 7]