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.

A358668 a(n) is the least m such that A359194^k(m) = n for some k >= 0 (where A359194^k denotes the k-th iterate of A359194).

Table of values

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

List of values

[0, 0, 2, 3, 4, 5, 3, 7, 8, 9, 7, 11, 12, 3, 14, 11, 11, 17, 11, 19, 20, 14, 12, 23, 3, 12, 26, 12, 28, 29, 11, 12, 32, 33, 12, 35, 36, 11, 38, 12, 29, 41, 42, 28, 44, 45, 12, 47, 48, 26, 50, 51, 12, 53, 54, 3, 56, 26, 23, 59, 60, 12, 62, 26, 26, 65, 26, 67, 68]

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

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