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.

A352406 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 5
1 2
2 7
3 3
4 8
5 14
6 5
7 7
8 4
9 12
10 46
11 34
12 18
13 21
14 21
15 16
16 5
17 10
18 8
19 25
20 128
21 237
22 79
23 25
24 266
25 25
26 10
27 74
28 34
29 27
30 6
31 11
32 22
33 23
34 72
35 75
36 26
37 267
38 16
39 893
40 28
41 40
42 8
43 113
44 27
45 16
46 163
47 41
48 13
49 27
50 169
51 48
52 837
53 7
54 88
55 436
56 23
57 144
58 59
59 36
60 77
61 71
62 466
63 96
64 14
65 226
66 371
67 72
68 231
69 463
70 377
71 29

List of values

[5, 2, 7, 3, 8, 14, 5, 7, 4, 12, 46, 34, 18, 21, 21, 16, 5, 10, 8, 25, 128, 237, 79, 25, 266, 25, 10, 74, 34, 27, 6, 11, 22, 23, 72, 75, 26, 267, 16, 893, 28, 40, 8, 113, 27, 16, 163, 41, 13, 27, 169, 48, 837, 7, 88, 436, 23, 144, 59, 36, 77, 71, 466, 96, 14, 226, 371, 72, 231, 463, 377, 29]