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

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A068064 a(n) = number of integers k such that palindrome A068062(n) = k + reverse(k). 1
 1, 1, 1, 1, 1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 9, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 1, 10, 3, 4, 5, 6, 7, 8, 9, 10, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 3, 6, 9, 12, 15, 18, 21, 24, 27, 30, 4, 8, 12, 16, 20, 24 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,7 COMMENTS The number of representions of a palindrome as a + b, where b = reverse(a); if a = reverse(b) and a is different from b, then a + b and b + a count as different representations. LINKS Table of n, a(n) for n=0..94. EXAMPLE a(8) = 4, since A068062(8) = 44 and for k = 13, 22, 31, 40 we have 44 = k + reverse(k). a(15) = 9, since A068062(15) = 121 and for k = 29, 38, 47, 56, 65, 74, 83, 92, 110 we have 121 = k + reverse(k). CROSSREFS Cf. A002113, A067030, A067032, A068062. Sequence in context: A112875 A113018 A113009 * A152147 A333830 A067032 Adjacent sequences: A068061 A068062 A068063 * A068065 A068066 A068067 KEYWORD base,nonn AUTHOR Klaus Brockhaus, Feb 16 2002 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.

Last modified December 10 04:38 EST 2023. Contains 367699 sequences. (Running on oeis4.)