A113177 - cp's OEIS frontend

A113177 Fully additive with a(p) = Fibonacci(p); If, for p prime, p^(m_{n,p}) is the highest power of p dividing n with m>=0, then a(n) = Sum_{p prime} F(p)*(m_{n,p}), where F(p) = p-th Fibonacci number.

n	a(n)
1	0
2	1
3	2
4	2
5	5
6	3
7	13
8	3
9	4
10	6
11	89
12	4
13	233
14	14
15	7
16	4
17	1597
18	5
19	4181
20	7
21	15
22	90
23	28657
24	5
25	10
26	234
27	6
28	15
29	514229
30	8
31	1346269
32	5
33	91
34	1598
35	18
36	6
37	24157817
38	4182
39	235
40	8
41	165580141
42	16
43	433494437
44	91
45	9
46	28658
47	2971215073
48	6
49	26
50	11
51	1599
52	235
53	53316291173
54	7
55	94

[0, 1, 2, 2, 5, 3, 13, 3, 4, 6, 89, 4, 233, 14, 7, 4, 1597, 5, 4181, 7, 15, 90, 28657, 5, 10, 234, 6, 15, 514229, 8, 1346269, 5, 91, 1598, 18, 6, 24157817, 4182, 235, 8, 165580141, 16, 433494437, 91, 9, 28658, 2971215073, 6, 26, 11, 1599, 235, 53316291173, 7, 94]

cp's OEIS Frontend

A113177 Fully additive with a(p) = Fibonacci(p); If, for p prime, p^(m_{n,p}) is the highest power of p dividing n with m>=0, then a(n) = Sum_{p prime} F(p)*(m_{n,p}), where F(p) = p-th Fibonacci number.

Table of values

List of values