A261081 - cp's OEIS frontend

A261081 a(n) = number of steps required to reach 0 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	2
3	3
4	5
5	7
6	10
7	15
8	23
9	34
10	51
11	76
12	113
13	169
14	254
15	384
16	583
17	888
18	1357
19	2080
20	3198
21	4931
22	7624
23	11817
24	18356
25	28567
26	44529
27	69503
28	108606
29	169868
30	265898
31	416506
32	652844
33	1023945
34	1607063
35	2524041
36	3967245
37	6240679
38	9825201
39	15481987
40	24416683
41	38539839
42	60880089

[0, 1, 2, 3, 5, 7, 10, 15, 23, 34, 51, 76, 113, 169, 254, 384, 583, 888, 1357, 2080, 3198, 4931, 7624, 11817, 18356, 28567, 44529, 69503, 108606, 169868, 265898, 416506, 652844, 1023945, 1607063, 2524041, 3967245, 6240679, 9825201, 15481987, 24416683, 38539839, 60880089]

cp's OEIS Frontend

A261081 a(n) = number of steps required to reach 0 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