A019274 - cp's OEIS frontend

A019274 Number of recursive calls needed to compute the n-th Fibonacci number F(n), starting with F(1) = F(2) = 1.

n	a(n)
1	0
2	0
3	2
4	4
5	8
6	14
7	24
8	40
9	66
10	108
11	176
12	286
13	464
14	752
15	1218
16	1972
17	3192
18	5166
19	8360
20	13528
21	21890
22	35420
23	57312
24	92734
25	150048
26	242784
27	392834
28	635620
29	1028456
30	1664078
31	2692536
32	4356616
33	7049154
34	11405772
35	18454928
36	29860702
37	48315632

[0, 0, 2, 4, 8, 14, 24, 40, 66, 108, 176, 286, 464, 752, 1218, 1972, 3192, 5166, 8360, 13528, 21890, 35420, 57312, 92734, 150048, 242784, 392834, 635620, 1028456, 1664078, 2692536, 4356616, 7049154, 11405772, 18454928, 29860702, 48315632]

cp's OEIS Frontend

A019274 Number of recursive calls needed to compute the n-th Fibonacci number F(n), starting with F(1) = F(2) = 1.

Table of values

List of values