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.

Showing 1-1 of 1 results.

A181361 Sum of cubes of digits of Fibonacci(n).

Original entry on oeis.org

0, 1, 1, 8, 27, 125, 512, 28, 9, 91, 250, 1241, 129, 62, 713, 217, 1584, 1198, 709, 578, 900, 1010, 689, 1204, 1035, 601, 793, 1523, 885, 935, 611, 1261, 1620, 1204, 1843, 1493, 981, 1397, 2726, 1897, 378, 1045, 2314, 1409, 1317, 1193, 1541, 1585, 2556, 2749
Offset: 0

Views

Author

Carmine Suriano, Oct 15 2010

Keywords

Examples

			a(11) = 1241 since Fibonacci(11) = 89 and 8^3+9^3 = 512+729 = 1241.
		

Crossrefs

Cf. A000045, sum of digits A004090, sum of squared digits A181357.

Programs

  • Maple
    f:= proc(n) local t; add(t^3, t = convert(combinat:-fibonacci(n),base,10)) end proc:
    map(f, [$0..100]); # Robert Israel, Jul 31 2025
  • Mathematica
    Total[IntegerDigits[#]^3]&/@Fibonacci[Range[50]] (* Harvey P. Dale, Mar 25 2012 *)

Formula

a(n) = A055012(A000045(n)). - Michel Marcus, Jul 18 2013

Extensions

a(0) = 0 inserted by Robert Israel, Jul 31 2025
Showing 1-1 of 1 results.