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.

A087664 Consider recurrence b(0) = n/4, b(k) = b(k-1)*floor(b(k-1)); sequence gives number of steps to reach an integer, or -1 if no integer is ever reached.

Table of values

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

List of values

[0, 2, 1, 4, 0, 5, 2, 9, 0, 1, 1, 1, 0, 3, 3, 2, 0, 4, 1, 2, 0, 6, 2, 7, 0, 1, 1, 1, 0, 5, 4, 4, 0, 2, 1, 3, 0, 8, 2, 7, 0, 1, 1, 1, 0, 2, 3, 6, 0, 3, 1, 2, 0, 2, 2, 2, 0, 1, 1, 1, 0, 4, 5, 5, 0, 2, 1, 6, 0, 5, 2, 4, 0, 1, 1, 1, 0, 4, 3, 2, 0, 5, 1, 2, 0, 3, 2, 3, 0, 1, 1, 1, 0, 4, 4, 6, 0, 2, 1, 3, 0, 3, 2, 3, 0]