A265523 a(n) = largest base-9 palindrome m <= n such that every base-9 digit of m is <= the corresponding digit of n; m is written in base 10.

0, 1, 2, 3, 4, 5, 6, 7, 8, 0, 10, 10, 10, 10, 10, 10, 10, 10, 0, 10, 20, 20, 20, 20, 20, 20, 20, 0, 10, 20, 30, 30, 30, 30, 30, 30, 0, 10, 20, 30, 40, 40, 40, 40, 40, 0, 10, 20, 30, 40, 50, 50, 50, 50, 0, 10, 20, 30, 40, 50, 60, 60, 60, 0, 10, 20, 30, 40, 50, 60, 70, 70, 0, 10, 20, 30, 40, 50, 60, 70, 80, 0, 82, 82

Offset

0,3

Links

Robert Israel, Table of n, a(n) for n = 0..10000

Maple

F:= proc(n) local L;
  L:= convert(n, base, 9);
if L[1] = 0 then return 0 fi;
  add(min(L[i], L[-i])*9^(i-1), i=1..nops(L))
end proc:
map(F, [$0..100]); # Robert Israel, Jan 13 2020

Crossrefs

Sequences related to palindromic floor and ceiling: A175298, A206913, A206914, A261423, A262038, and the large block of consecutive sequences beginning at A265509.

Sequence in context: A257849 A190727 A195832 * A004184 A160933 A265524

Adjacent sequences: A265520 A265521 A265522 * A265524 A265525 A265526

Keyword

nonn,base,look

Author

N. J. A. Sloane, Dec 09 2015

Status

approved