A261091 - cp's OEIS frontend

A261091 a(n) = number of steps required to reach F(n+1)-1 from F(n+2)-1 by repeatedly subtracting from a natural number the number of ones in its Zeckendorf representation. Here F(n) = the n-th Fibonacci number, F(0) = 0, F(1) = 1, F(2) = 1, F(3) = 2, ...

n	a(n)
0	0
1	1
2	1
3	1
4	2
5	2
6	3
7	5
8	8
9	11
10	17
11	25
12	37
13	56
14	85
15	130
16	199
17	305
18	469
19	723
20	1118
21	1733
22	2693
23	4193
24	6539
25	10211
26	15962
27	24974
28	39103
29	61262
30	96030
31	150608
32	236338
33	371101
34	583118
35	916978
36	1443204
37	2273434
38	3584522
39	5656786
40	8934696
41	14123156
42	22340250

[0, 1, 1, 1, 2, 2, 3, 5, 8, 11, 17, 25, 37, 56, 85, 130, 199, 305, 469, 723, 1118, 1733, 2693, 4193, 6539, 10211, 15962, 24974, 39103, 61262, 96030, 150608, 236338, 371101, 583118, 916978, 1443204, 2273434, 3584522, 5656786, 8934696, 14123156, 22340250]

cp's OEIS Frontend

A261091 a(n) = number of steps required to reach F(n+1)-1 from F(n+2)-1 by repeatedly subtracting from a natural number the number of ones in its Zeckendorf representation. Here F(n) = the n-th Fibonacci number, F(0) = 0, F(1) = 1, F(2) = 1, F(3) = 2, ...

Table of values

List of values