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.

A334245 Let S = A061228, T = A070229, and F = S o T (where o denotes composition). Then a(n) is the least number in the intersection of the sequences F^k(n) and F^k(S(n)), k>=0, or the intersection of the sequences T(F^k(n)) and T(F^k(S(n))), k>=0, or 0 if these intersections are empty.

Table of values

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

List of values

[12, 12, 12, 15, 12, 30, 15, 21, 15, 77, 21, 77, 30, 77, 30, 77, 30, 57, 77, 30, 77, 91, 77, 77, 77, 77, 35, 105, 77, 133, 77, 91, 77, 60, 77, 111, 57, 77, 77, 133, 77, 165, 91, 65, 91, 147, 60, 105, 65, 70, 65, 165, 77, 105, 105, 91, 105, 180, 133, 231, 133, 91, 105, 105, 105, 234, 105, 147, 91]