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 A373465 #17 Sep 01 2024 17:41:16
%S A373465 6006,8778,20202,28182,40404,41514,43134,50505,60606,63336,66066,
%T A373465 68586,80808,83538,86268,87978,111111,141141,168861,171171,202202,
%U A373465 204402,209902,210012,212212,219912,225522,231132,232232,239932,246642,249942,252252,258852,262262,266662,272272
%N A373465 Palindromes with exactly 5 distinct prime divisors.
%F A373465 Intersection of A002113 and A051270.
%e A373465 a(1) = 6006 = 2 * 3 * 7 * 11 * 13 is a palindrome (A002113) with 5 prime divisors.
%e A373465 a(5) = 40404 = 2^2 * 3 * 7 * 13 * 37 also is a palindrome with 5 prime divisors, although the divisor 2 occurs twice as a factor in the factorization.
%t A373465 Select[Range[300000],PalindromeQ[#]&&Length[FactorInteger[#]]==5&] (* _James C. McMahon_, Jun 08 2024 *)
%t A373465 Select[Range[300000],PalindromeQ[#]&&PrimeNu[#]==5&] (* _Harvey P. Dale_, Sep 01 2024 *)
%o A373465 (PARI) A373465_upto(N, start=1, num_fact=5)={ my(L=List()); while(N >= start = nxt_A002113(start), omega(start)==num_fact && listput(L, start)); L}
%Y A373465 Cf. A002113 (palindromes), A051270 (omega(.) = 5).
%Y A373465 Cf. A046331 (same but counting prime factors with multiplicity), A046395 (same but squarefree), A373466 (same with omega = 6), A373467 (with omega = 7).
%K A373465 nonn,base
%O A373465 1,1
%A A373465 _M. F. Hasler_, Jun 06 2024