login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A176721
Partial sums of A047076.
0
2, 30205, 133050536, 1713435083707, 12173043638400828, 151229306063970112979, 1815272942608097141328160, 16183327444272811414262846321, 331634334544577293143126414662454
OFFSET
1,1
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?
FORMULA
a(n) = SUM[i=1..n] A047076(i).
EXAMPLE
a(8) = 2 + 30203 + 133020331 + 1713302033171 + 12171330203317121 + 151217133020331712151 + 1815121713302033171215181 + 16181512171330203317121518161 = 16183327444272811414262846321 is prime
CROSSREFS
Sequence in context: A233460 A324164 A047076 * A030462 A228556 A001377
KEYWORD
base,nonn
AUTHOR
Jonathan Vos Post, Apr 25 2010
STATUS
approved