Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A114996
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
1
0, -1, 2, 3, 22, 151, 222, 232, 323, 333, 353, 37273, 77577, 7772777, 377777773, 5777777775, 77777777777, 27777777777772, 577777757777775, 577777777777775, 37777777777777773, 2777777775777777772, 7777777775777777777 (list; graph; listen)
OFFSET

0,3

COMMENT

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: A032810 A062921 A083178 this_sequence A137077 A046965 A119679

Adjacent sequences: A114993 A114994 A114995 this_sequence A114997 A114998 A114999

KEYWORD

base,sign

AUTHOR

Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Feb 23 2006

EXTENSIONS

Edited, corrected and extended by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Mar 13 2006

a(16) and a(19) corrected, a(21) and a(22) added by Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), May 23 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research