cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A181357 Sum of squares of digits of Fibonacci(n).

Original entry on oeis.org

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
Offset: 1

Views

Author

Carmine Suriano, Oct 14 2010

Keywords

Examples

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

Crossrefs

Programs

  • 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 *)

Formula

a(n) = A003132(A000045(n)). - Jonathan Vos Post, Oct 14 2010