login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A262087 Largest palindrome p such that n-p is again a palindrome, or 0 if no such p exists. 2
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 9, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 0, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 0, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 0, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 0, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 0, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 0, 77, 77, 77, 77, 77, 77 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = 0 for n in {0} union A035137.
PROG
(PARI) a(N, P=A261423(N))=until(N<2*P=A261423(P-1), is_A002113(N-P)&&return(P))
CROSSREFS
Sequence in context: A017884 A072139 A266325 * A261914 A261423 A262040
KEYWORD
nonn,base
AUTHOR
M. F. Hasler, Sep 10 2015
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 11:39 EDT 2024. Contains 371969 sequences. (Running on oeis4.)