|
%I #15 Jan 05 2022 18:52:40
%S 1,0,6,5,4,0,1,3,1,3,13,0,9,21,6,14,13,9,13,2,1,18,18,9,1,9,2,3,30,0,
%T 12,21,38,3,27,38,2,3,2,13,3,18,34,1,5,3,28,0,1,21,14,38,1,18,40,1,2,
%U 30,65,21,34,48,64,55,45,0,49,33,60,63,3,24,5,21,2
%N a(n) = F(n) mod s(n) where s(n) is the sum of the digits of the n-th Fibonacci number F(n).
%H Alois P. Heinz, <a href="/A110390/b110390.txt">Table of n, a(n) for n = 7..10000</a>
%F a(n) = A000045(n) mod A007953(A000045(n)) = A000045(n) mod A004090(n).
%e a(9) = 34 mod 7 = 6.
%p a:= n-> (f-> irem(f, add(i, i=convert(f, base, 10))))(combinat[fibonacci](n)):
%p seq(a(n), n=7..100); # _Alois P. Heinz_, Jan 05 2022
%t Do[k = Fibonacci[n]; Print[Mod[k, Plus @@ IntegerDigits[k]]], {n, 7, 56}] (* _Ryan Propper_, Aug 14 2005 *)
%t Mod[#,Total[IntegerDigits[#]]]&/@Fibonacci[Range[7,70]] (* _Harvey P. Dale_, Dec 05 2015 *)
%Y Cf. A000045, A004090, A007953.
%K base,easy,nonn
%O 7,3
%A _Amarnath Murthy_, Jul 27 2005
%E More terms from _Ryan Propper_, Aug 14 2005
%E More terms from _Harvey P. Dale_, Dec 05 2015
|
