A261082 - cp's OEIS frontend

A261082 a(n) = number of steps required to reach 0 from F(n+2) 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	1
1	2
2	3
3	4
4	6
5	8
6	11
7	16
8	24
9	35
10	52
11	77
12	114
13	170
14	255
15	385
16	584
17	889
18	1358
19	2081
20	3199
21	4932
22	7625
23	11818
24	18357
25	28568
26	44530
27	69504
28	108607
29	169869
30	265899
31	416507
32	652845
33	1023946
34	1607064
35	2524042
36	3967246
37	6240680
38	9825202
39	15481988
40	24416684
41	38539840
42	60880090

[1, 2, 3, 4, 6, 8, 11, 16, 24, 35, 52, 77, 114, 170, 255, 385, 584, 889, 1358, 2081, 3199, 4932, 7625, 11818, 18357, 28568, 44530, 69504, 108607, 169869, 265899, 416507, 652845, 1023946, 1607064, 2524042, 3967246, 6240680, 9825202, 15481988, 24416684, 38539840, 60880090]

cp's OEIS Frontend

A261082 a(n) = number of steps required to reach 0 from F(n+2) 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