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.

A271418 Define a sequence by b(1) = n, b(m) = b(m-1) + b(m-1)/A052126(m) + 1; then a(n) is the least m such that b(m) belongs to A270807.

Table of values

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

List of values

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.