login
Sum of squares of digits of Fibonacci(n).
2

%I #11 Jul 24 2019 20:39:43

%S 1,1,4,9,25,64,10,5,25,50,145,33,22,107,37,194,156,109,82,146,134,101,

%T 178,161,103,105,199,125,131,93,183,208,192,255,215,145,209,336,271,

%U 90,169,308,221,197,167,211,223,360,377,280,141,350,225,321,350,256,282

%N Sum of squares of digits of Fibonacci(n).

%F a(n) = A003132(A000045(n)). - _Jonathan Vos Post_, Oct 14 2010

%e a(11) = 145 since Fibonacci(11) = 89 and 8^2 + 9^2 = 64+81 = 145.

%p A003132 := proc(n) local d; add(d^2,d=convert(n,base,10)) ; end proc:

%p A181357 := proc(n) A003132(combinat[fibonacci](n)) ; end proc: seq(A181357(n),n=1..90) ; # _R. J. Mathar_, Oct 15 2010

%t Table[Total[IntegerDigits[Fibonacci[n]]^2],{n,60}] (* _Harvey P. Dale_, Jan 20 2017 *)

%Y Cf. A000045, A003132.

%K nonn,base

%O 1,3

%A _Carmine Suriano_, Oct 14 2010