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.

A116964 Sum of all n-digit Lucas numbers.

Original entry on oeis.org

17, 181, 2008, 22269, 143285, 1692737, 18772741, 208192888, 2308894509, 14856075365, 175506357617, 1946395332181, 21585855011608, 138889450176440, 1640808956134074, 18196850168753057, 201806160812417701, 2238064619105347768, 14400335971854080600, 170122354174067662074
Offset: 1

Views

Author

Parthasarathy Nambi, May 27 2007

Keywords

Examples

			The sum of all 1-digit Lucas numbers is 17, so a(1) = 17.
The sum of all 2-digit Lucas numbers is 181, so a(2) = 181.
		

Crossrefs

Programs

  • Mathematica
    Total/@Table[Select[Table[LucasL[n],{n,0,95}], IntegerLength[#]==i&], {i,20}]  (* Harvey P. Dale, Mar 31 2011 *)
    nn = 20; t = Table[0, {nn}]; k = 0; While[luc = LucasL[k]; d = IntegerLength[luc]; d <= nn, t[[d]] = t[[d]] + luc; k++]; t (* T. D. Noe, Mar 31 2011 *)

Extensions

More terms from Harvey P. Dale, Mar 31 2011