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 A088882 #15 Jun 08 2025 16:15:42 %S A088882 101,121,131,141,151,161,171,181,191,202,212,232,242,252,262,272,282, %T A088882 292,303,313,323,343,353,363,373,383,393,404,414,424,434,454,464,474, %U A088882 484,494,505,515,525,535,545,565,575,585,595,606,616,626,636,646,656,676 %N A088882 Nontrivial palindromes in base 10 (i.e., palindromes that are not RepDigits such as 3, 111, 22222, or 888888888). %C A088882 The early portion of this sequence appears to be very similar to the early portions of two other sequences. Note that a(n) = A046075(n) for n = 1..81. A046075 deals with nontrivial undulants of 3 digits or more which by definition excludes RepDigits, but which includes non-palindromic terms when 4-digit numbers are reached. For example a(82) = 1001 but A046075(82) = 1010. Note also that a(n) = A050783(n+10) for n = 1..81. A050783 deals with palindromes that contain no consecutive pairs of equal digits, so although A050783 excludes RepDigits, it includes the single-digit palindromes and excludes a large number of the palindromes in this sequence (such as, for example, all the 4-digit nontrivial palindromes and larger nontrivial palindromes such as 22022 or 61116). A050783(92) = 10101. Note that in the first 65534 values of n there are 754 palindromes, 712 nontrivial palindromes and 42 RepDigits. %H A088882 Michael S. Branicky, <a href="/A088882/b088882.txt">Table of n, a(n) for n = 1..10000</a> %e A088882 a(4) = 141 because 141 is the fourth term of the sequence of base-10 palindromes (A002113) that does not appear in the sequence of RepDigits (A010785). %o A088882 (Python) %o A088882 from itertools import count, islice, product %o A088882 def agen(): # generator of terms %o A088882 digits = "0123456789" %o A088882 for d in count(3): %o A088882 for p in product(digits, repeat=d//2): %o A088882 if d > 1 and p[0] == "0": continue %o A088882 left = "".join(p); right = left[::-1] %o A088882 for mid in [[""], digits][d%2]: %o A088882 t = left + mid + right %o A088882 if len(set(t)) != 1: yield int(t) %o A088882 print(list(islice(agen(), 52))) # _Michael S. Branicky_, May 17 2022 %Y A088882 Cf. A002113 (base-10 palindromes), A010785 (repdigits), A046075 (nontrivial undulants), A050783 (palindromes with no pair of consecutive equal digits). %K A088882 base,nonn %O A088882 1,1 %A A088882 _Chuck Seggelin_, Oct 21 2003