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.

A352407 The number of terms before reaching zero when starting at n and iterating: f(n) = n, f(n+1) = n+1; f(n+k) = (f(n+k-2) * f(n+k-1)) (mod (n+k)), where k>=2.

Table of values

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

List of values

[2, 3, 14, 5, 5, 11, 4, 42, 54, 6, 17, 38, 6, 27, 12, 71, 20, 5, 6, 8, 12, 12, 42, 37, 36, 23, 22, 9, 5, 19, 10, 35, 31, 31, 60, 47, 33, 44, 46, 15, 8, 49, 14, 9, 12, 23, 35, 34, 28, 11, 86, 43, 20, 49, 18, 17, 12, 9, 22, 45, 26, 5, 31, 51, 72, 7, 6, 121, 120, 111, 86, 341, 56, 63, 12, 85, 12, 21]