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”).

A114996
a(n) = smallest palindrome > a(n-1) (for n > 0) such that the sum of its prime digits is equal to palindrome with index n, or -1 if none exists.
0
0, -1, 2, 3, 22, 151, 222, 232, 323, 333, 353, 37273, 77577, 7772777, 377777773, 5777777775, 77777777777, 27777777777772, 577777757777775, 577777777777775, 37777777777777773, 2777777775777777772, 7777777775777777777
OFFSET
0,3
COMMENTS
Palindrome with index n is A002113(n).
EXAMPLE
a(0) = 0 since A002113(0) = 0 and the prime digits of 0 sum to 0.
a(1) = -1 since A002113(1) = 1 and there is no number (all the more no palindrome) whose prime digits sum to 1.
a(5) = 151 since A002113(5) = 5 and 151 is the smallest palindrome > a(4) = 22 whose prime digits sum to 5.
CROSSREFS
Cf. A002113.
Sequence in context: A264696 A166122 A366405 * A153256 A137077 A046965
KEYWORD
base,sign
AUTHOR
Giovanni Teofilatto, Feb 23 2006
EXTENSIONS
Edited, corrected and extended by Klaus Brockhaus, Mar 13 2006
a(16) and a(19) corrected, a(21) and a(22) added by Klaus Brockhaus, May 23 2007
STATUS
approved