This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A262223 a(n) = n + largest palindrome contained in decimal representation of n. 3
 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 11, 22, 14, 16, 18, 20, 22, 24, 26, 28, 22, 23, 44, 26, 28, 30, 32, 34, 36, 38, 33, 34, 35, 66, 38, 40, 42, 44, 46, 48, 44, 45, 46, 47, 88, 50, 52, 54, 56, 58, 55, 56, 57, 58, 59, 110, 62, 64, 66, 68, 66, 67, 68, 69, 70, 71 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS a(n) = n + A047813(n). LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..10000 PROG (Haskell) a262223 n = n + a047813 n CROSSREFS Cf. A047813, A262224 (iteration, start = 1). Sequence in context: A063114 A064806 A062028 * A070196 A056964 A052008 Adjacent sequences:  A262220 A262221 A262222 * A262224 A262225 A262226 KEYWORD nonn,base AUTHOR Reinhard Zumkeller, Sep 15 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 13 08:08 EST 2018. Contains 318082 sequences. (Running on oeis4.)