This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A266140 #13 Aug 07 2025 07:21:24 %S A266140 0,1,2,3,4,5,6,7,8,9,11,22,33,44,55,66,77,88,99,101,111,121,131,141, %T A266140 151,161,171,181,191,202,212,222,232,242,252,262,272,282,292,303,313, %U A266140 323,333,343,353,363,373,383,393,404,414,424,434,444,454,464,474,484 %N A266140 Palindromes such that removing at most one digit will result in a term in A110784. %C A266140 Union of A266139 and A110784. Every palindrome p can have its digits permuted to produce a term m <= p in this sequence, and this sequence is the minimal such sequence (i.e., no term in the sequence can have its digits permuted to form another term in the sequence). Palindromes modulo permutation of digits. %C A266140 a(n) = A110751(n-1) for 2<=n<=109, which means A110751 contains numbers like 1001 and 1089 which are absent here. - _R. J. Mathar_, Aug 07 2025 %C A266140 The first entry of A002113 not in this sequence here is 1001. - _R. J. Mathar_, Aug 07 2025 %H A266140 Chai Wah Wu, <a href="/A266140/b266140.txt">Table of n, a(n) for n = 1..10000</a> %Y A266140 Cf. A110784, A266139. %K A266140 nonn,base,easy %O A266140 1,3 %A A266140 _Chai Wah Wu_, Dec 25 2015