login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A181357 Sum of squares of digits of Fibonacci(n). 2
1, 1, 4, 9, 25, 64, 10, 5, 25, 50, 145, 33, 22, 107, 37, 194, 156, 109, 82, 146, 134, 101, 178, 161, 103, 105, 199, 125, 131, 93, 183, 208, 192, 255, 215, 145, 209, 336, 271, 90, 169, 308, 221, 197, 167, 211, 223, 360, 377, 280, 141, 350, 225, 321, 350, 256, 282 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
a(n) = A003132(A000045(n)). - Jonathan Vos Post, Oct 14 2010
EXAMPLE
a(11) = 145 since Fibonacci(11) = 89 and 8^2 + 9^2 = 64+81 = 145.
MAPLE
A003132 := proc(n) local d; add(d^2, d=convert(n, base, 10)) ; end proc:
A181357 := proc(n) A003132(combinat[fibonacci](n)) ; end proc: seq(A181357(n), n=1..90) ; # R. J. Mathar, Oct 15 2010
MATHEMATICA
Table[Total[IntegerDigits[Fibonacci[n]]^2], {n, 60}] (* Harvey P. Dale, Jan 20 2017 *)
CROSSREFS
Sequence in context: A160190 A226917 A032127 * A244558 A175627 A007598
KEYWORD
nonn,base
AUTHOR
Carmine Suriano, Oct 14 2010
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)