|
Search: id:A113177
|
|
|
| A113177 |
|
If, for p = prime, p^(m_{n,p}) is highest power of p dividing n, m= nonnegative integer, then a(n) is sum over all primes of F(p)*(m_{n,p}), where F(p)= pth Fibonacci number. |
|
+0
2
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
FORMULA
|
Totally additive with a(p) = F(p).
|
|
EXAMPLE
|
12 = 2^2 * 3^1, so a(12) = F(2)*2 + F(3)*1 = 2 + 2 = 4.
|
|
MATHEMATICA
|
b[t_]:=Fibonacci[First[t]]Last[t] a[n_]:=Apply[Plus, Map[b, FactorInteger[n]]] (Peuha)
|
|
PROGRAM
|
(PARI) { for(n=1, 100, f=factor(n); s=0; \ for(i=1, matsize(f)[1], s+=fibonacci(f[i, 1])*f[i, 2]); \ print1(s, ", ")) } (Klasen)
|
|
CROSSREFS
|
Cf. A113178, A000045.
Adjacent sequences: A113174 A113175 A113176 this_sequence A113178 A113179 A113180
Sequence in context: A006307 A133440 A006800 this_sequence A135281 A068465 A025498
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Oct 16 2005
|
|
EXTENSIONS
|
More terms from Esa Peuha (esa.peuha(AT)helsinki.fi) and Lambert Klasen (lambert.klasen(AT)gmx.net), Oct 26 2005
|
|
|
Search completed in 0.002 seconds
|
