OFFSET
1,3
LINKS
G. C. Greubel, Table of n, a(n) for n = 1..1000
FORMULA
a(n) = ds_prime(n)(Fib(n)), where ds_prime(n) = digital sum base the n-th prime.
a(n) = Fibonacci(n) - (prime(n)-1)*Sum{k>0} ( floor(Fibonacci(n)/prime(n)^k) ).
EXAMPLE
a(2) = ds_prime(2)(Fib(2)) = ds_3(1) = 1;
a(10) = ds_prime(10)(55) = ds_29(55) = 1+26 = 27.
MATHEMATICA
Table[Total[IntegerDigits[Fibonacci[n], Prime[n]]], {n, 60}] (* Harvey P. Dale, May 05 2013 *)
PROG
(PARI) a(n) = vecsum(digits(fibonacci(n), prime(n))); \\ Michel Marcus, Sep 24 2016
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Hieronymus Fischer, Dec 24 2007
STATUS
approved