The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #12 Jun 24 2022 04:44:44
%S 1,2,3,4,5,6,7,8,9,101,111,131,141,151,161,171,181,191,202,212,222,
%T 232,252,262,272,282,292,303,313,323,333,343,353,373,383,393,404,414,
%U 424,434,444,454,464,474,494,505,515,525,535,545,555,565,575,585,595,606
%N Decimal palindromes that are not multiples of 11.
%C A083850(a(n)) = 0; all members have odd length.
%H Charles R Greathouse IV, <a href="/A083851/b083851.txt">Table of n, a(n) for n = 1..10000</a>
%t max = 600; Complement[Select[Range[max], IntegerDigits[#] == Reverse[IntegerDigits[#]] &], 11Range[Ceiling[max/11]]] (* _Alonso del Arte_, May 11 2014 *)
%o (PARI) is(n)=n%11 && subst(Polrev(digits(n)), 'x, 10)==n \\ _Charles R Greathouse IV_, May 14 2014
%o (Python)
%o from itertools import chain, count, islice
%o def A083851_gen(): # generator of terms
%o return filter(lambda n: n % 11,chain.from_iterable((int((s:=str(d))+s[-2::-1]) for d in range(10**l,10**(l+1))) for l in count(0)))
%o A083851_list = list(islice(A083851_gen(),20)) # _Chai Wah Wu_, Jun 23 2022
%Y Cf. A083852, A002113, A008593.
%K nonn,base
%O 1,2
%A _Reinhard Zumkeller_, May 06 2003