|
Search: id:A113175
|
|
|
| A113175 |
|
Replace each prime p in prime-factorization of n with pth Fibonacci number. |
|
+0
2
|
|
| 1, 1, 2, 1, 5, 2, 13, 1, 4, 5, 89, 2, 233, 13, 10, 1, 1597, 4, 4181, 5, 26, 89, 28657, 2, 25, 233, 8, 13, 514229, 10, 1346269, 1, 178, 1597, 65, 4, 24157817, 4181, 466, 5, 165580141, 26, 433494437, 89, 20, 28657, 2971215073, 2, 169, 25, 3194, 233
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
If, for p = prime, p^(m_{n,p}) is highest power of p dividing n, m= nonnegative integer, then a(n) is product over all primes of F(p)^(m_{n,p}), where F(p)= pth Fibonacci number.
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
FORMULA
|
Totally multiplicative with a(p) = F(p). - Frank Adams-Watters (FrankTAW(AT)Netscape.net), Jun 05 2006
|
|
EXAMPLE
|
63 = 3^2 * 7^1. So a(63) = F(3)^2 * F(7)^1 = 4 * 13 = 52.
|
|
MATHEMATICA
|
b[t_]:=Fibonacci[First[t]]^Last[t] a[n_]:=Apply[Times, Map[b, FactorInteger[n]]] (Peuha)
|
|
CROSSREFS
|
Cf. A113176, A000045.
Sequence in context: A167160 A082010 A113176 this_sequence A109191 A087123 A097131
Adjacent sequences: A113172 A113173 A113174 this_sequence A113176 A113177 A113178
|
|
KEYWORD
|
mult,nonn
|
|
AUTHOR
|
Leroy Quet Oct 16 2005
|
|
EXTENSIONS
|
More terms from Esa Peuha (esa.peuha(AT)helsinki.fi), Oct 26 2005
|
|
|
Search completed in 0.002 seconds
|
