OFFSET
1,6
COMMENTS
From Amiram Eldar, Aug 09 2024: (Start)
The number of factors of n of the form p^Fibonacci(k), where p is a prime and k >= 2, when the factorization is uniquely done using the Zeckendorf representation of the exponents in the prime factorization of n.
LINKS
FORMULA
MATHEMATICA
z[n_] := Length[DeleteCases[NestWhileList[# - Fibonacci[Floor[Log[Sqrt[5]*# + 3/2]/Log[GoldenRatio]]] &, n, # > 1 &], 0]]; a[n_] := Total[z /@ FactorInteger[n][[;; , 2]]]; a[1] = 0; Array[a, 100] (* Amiram Eldar, May 15 2023 *)
PROG
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Aug 30 2018
STATUS
approved