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.

A377208 a(n) is the number of iterations that n requires to reach a noninteger or a Fibonacci number under the map x -> x / z(x), where z(k) = A007895(k) is the number of terms in the Zeckendorf representation of k; a(n) = 0 if n is a Fibonacci number.

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 0
6 1
7 1
8 0
9 1
10 1
11 1
12 2
13 0
14 2
15 1
16 1
17 1
18 2
19 1
20 1
21 0
22 2
23 1
24 3
25 1
26 1
27 2
28 1
29 1
30 2
31 1
32 1
33 1
34 0
35 1
36 3
37 1
38 1
39 1
40 1
41 1
42 1
43 1
44 1
45 2
46 1
47 1
48 2
49 1
50 1
51 1
52 1
53 1
54 1
55 0
56 2
57 1
58 2
59 1
60 3
61 1
62 1
63 1
64 1
65 1
66 3
67 1
68 1
69 2
70 1
71 1
72 3
73 1
74 1
75 1
76 2
77 1
78 2
79 1
80 2
81 3
82 1
83 1
84 2
85 1
86 1
87 1
88 1
89 0
90 3
91 1
92 2
93 2
94 2
95 1
96 2
97 1
98 1
99 2
100 1

List of values

[0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 2, 0, 2, 1, 1, 1, 2, 1, 1, 0, 2, 1, 3, 1, 1, 2, 1, 1, 2, 1, 1, 1, 0, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 0, 2, 1, 2, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 2, 1, 1, 3, 1, 1, 1, 2, 1, 2, 1, 2, 3, 1, 1, 2, 1, 1, 1, 1, 0, 3, 1, 2, 2, 2, 1, 2, 1, 1, 2, 1]