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.

A357610 Start with x = 3 and repeat the map x -> floor(n/x) + (n mod x) until an x occurs that has already appeared, then that is a(n).

Table of values

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

List of values

[1, 2, 3, 2, 3, 3, 3, 4, 3, 4, 3, 3, 5, 6, 3, 6, 5, 3, 7, 5, 3, 8, 7, 3, 9, 6, 3, 10, 9, 3, 11, 8, 3, 12, 5, 3, 13, 10, 3, 14, 9, 3, 15, 11, 3, 16, 11, 3, 17, 5, 3, 18, 5, 3, 19, 12, 3, 20, 11, 3, 21, 14, 3, 22, 5, 3, 23, 8, 3, 24, 15, 3, 25, 14, 3, 26, 17, 3, 27, 5, 3, 28, 11, 3, 29, 18, 3, 30, 9]