The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A248336 Smallest number m such that the Levenshtein distance of m and its reversal equals n. 2
 0, 10, 12, 1000, 1022, 100000, 100222, 10000000, 10002222, 1000000000, 1000022222, 100000000000, 100000222222, 10000000000000, 10000002222222, 1000000000000000, 1000000022222222, 100000000000000000, 100000000222222222, 10000000000000000000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS A248327(a(n)) = n and A248327(m) != n for m < a(n). LINKS FORMULA a(2*k) = 10^(2*k-1) + 2*(10^k-1)/9; a(2*k+1) = 10^(2*k+1). Conjecture: a(n) = 111*a(n-2)-1110*a(n-4)+1000*a(n-6) for n>6. - Colin Barker, Oct 07 2014 Empirical g.f.: -2*x*(50*x^5+50*x^4-155*x^3-55*x^2+6*x+5) / ((x-1)*(x+1)*(10*x-1)*(10*x+1)*(10*x^2-1)). - Colin Barker, Oct 07 2014 PROG (Haskell) import Data.List (elemIndex); import Data.Maybe (fromJust) a248336 = fromJust . (`elemIndex` map a248327 [0..]) (PARI) s=[0, 10]; for(k=1, 12, s=concat(s, [10^(2*k-1)+2*(10^k-1)/9, 10^(2*k+1)])); s \\ Colin Barker, Oct 07 2014 CROSSREFS Cf. A004086, A248327. Sequence in context: A087392 A255534 A262422 * A332478 A144814 A241174 Adjacent sequences:  A248333 A248334 A248335 * A248337 A248338 A248339 KEYWORD nonn,base AUTHOR Reinhard Zumkeller, Oct 05 2014 EXTENSIONS Formula corrected by, and more terms from Colin Barker, Oct 07 2014 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 September 26 06:16 EDT 2021. Contains 347664 sequences. (Running on oeis4.)