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 A372149 #46 Jun 01 2025 12:39:14
%S A372149 1,3,5,7,9,11,33,55,77,99,111,131,151,171,191,313,333,353,373,393,515,
%T A372149 535,555,575,595,717,737,757,777,797,919,939,959,979,999,1111,1331,
%U A372149 1551,1771,1991,3113,3333,3553,3773,3993,5115,5335,5555,5775,5995,7117,7337,7557,7777,7997
%N A372149 Palindrome numbers consisting only of odd digits.
%H A372149 Michael S. Branicky, <a href="/A372149/b372149.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from James S. DeArmon)
%H A372149 James S. DeArmon, <a href="/A372149/a372149.txt">Common LISP code to create A372149</a>
%t A372149 Select[Range[8000], PalindromeQ[#] && Times@@Boole[OddQ[IntegerDigits[#]]] == 1 &] (* _Stefano Spezia_, Apr 30 2024 *)
%o A372149 (Common Lisp) ; See Links section.
%o A372149 (Python)
%o A372149 from itertools import count, islice, product
%o A372149 def agen(): # generator of terms
%o A372149 for d in count(1):
%o A372149 for p in product("13579", repeat=d//2):
%o A372149 left = "".join(p)
%o A372149 for mid in [[""], "13579"][d&1]:
%o A372149 yield int(left + mid + left[::-1])
%o A372149 print(list(islice(agen(), 60))) # _Michael S. Branicky_, Jun 01 2025
%Y A372149 Intersection of A002113 and A014261.
%Y A372149 Cf. A056524, A056525.
%K A372149 nonn,base
%O A372149 1,2
%A A372149 _James S. DeArmon_, Apr 20 2024
%E A372149 Missing 1551 inserted by _Stefano Spezia_, Apr 30 2024