OFFSET
1,2
COMMENTS
Numbers k such that a(k) = k are exactly 5-smooth numbers (A051037). - Ivan Neretin, Aug 30 2015
LINKS
Ivan Neretin, Table of n, a(n) for n = 1..10000
FORMULA
If n = Product p(k)^e(k) then a(n) = Product Fibonacci(k+2)^e(k).
Sum_{n>=1} 1/a(n) = 1 / A337669 = 5.269005... . - Amiram Eldar, Dec 24 2022
MATHEMATICA
Table[Times @@ (Fibonacci[PrimePi[#[[1]]] + 2]^#[[2]] & /@ FactorInteger[n]), {n, 67}] (* Ivan Neretin, Aug 30 2015 *)
PROG
(PARI) a(n) = my(f=factor(n)); for (k=1, #f~, f[k, 1] = fibonacci(primepi(f[k, 1])+2)); factorback(f); \\ Michel Marcus, Jan 14 2021
CROSSREFS
KEYWORD
nonn,mult
AUTHOR
STATUS
approved