A087676 - cp's OEIS frontend

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

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

[0, 3, 5, 0, 1, 1, 0, 12, 2, 0, 3, 7, 0, 1, 1, 0, 2, 7, 0, 2, 2, 0, 1, 1, 0, 5, 5, 0, 7, 4, 0, 1, 1, 0, 6, 2, 0, 4, 3, 0, 1, 1, 0, 2, 5, 0, 2, 2, 0, 1, 1, 0, 3, 3, 0, 6, 3, 0, 1, 1, 0, 3, 2, 0, 5, 5, 0, 1, 1, 0, 2, 3, 0, 2, 2, 0, 1, 1, 0, 5, 4, 0, 3, 4, 0, 1, 1, 0, 5, 2, 0, 3, 4, 0, 1, 1, 0, 2, 4, 0, 2, 2, 0, 1, 1]

cp's OEIS Frontend

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

Table of values

List of values

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

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

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