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-2 of 2 results.

A046489 Sum of the first n palindromes (A002113).

Original entry on oeis.org

1, 3, 6, 10, 15, 21, 28, 36, 45, 56, 78, 111, 155, 210, 276, 353, 441, 540, 641, 752, 873, 1004, 1145, 1296, 1457, 1628, 1809, 2000, 2202, 2414, 2636, 2868, 3110, 3362, 3624, 3896, 4178, 4470, 4773, 5086, 5409, 5742, 6085, 6438, 6801, 7174, 7557, 7950, 8354
Offset: 0

Views

Author

Patrick De Geest, Sep 15 1998

Keywords

Crossrefs

Programs

  • Mathematica
    palQ[n_] := Reverse[x = IntegerDigits[n]] == x; Accumulate[Select[Range[410], palQ]] (* Jayanta Basu, Jun 26 2013 *)

A176721 Partial sums of A047076.

Original entry on oeis.org

2, 30205, 133050536, 1713435083707, 12173043638400828, 151229306063970112979, 1815272942608097141328160, 16183327444272811414262846321, 331634334544577293143126414662454
Offset: 1

Views

Author

Jonathan Vos Post, Apr 25 2010

Keywords

Comments

Partial sums of a(n+1) is the smallest palindromic prime containing exactly 2 more digits on each end than the previous term, with a(n) as a central substring. Can this partial sum ever be a palindromic prime?

Examples

			a(8) = 2 + 30203 + 133020331 + 1713302033171 + 12171330203317121 + 151217133020331712151 + 1815121713302033171215181 + 16181512171330203317121518161 = 16183327444272811414262846321 is prime
		

Crossrefs

Formula

a(n) = SUM[i=1..n] A047076(i).
Showing 1-2 of 2 results.