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 A046395 #20 Jun 07 2024 08:05:13 %S A046395 6006,8778,20202,28182,41514,43134,50505,68586,87978,111111,141141, %T A046395 168861,202202,204402,209902,246642,249942,262262,266662,303303, %U A046395 323323,393393,399993,438834,454454,505505,507705,515515,516615,519915,534435,535535,543345 %N A046395 Palindromes that are the product of 5 distinct primes. %C A046395 No exponent of the distinct prime factors can be greater than one, i.e., no prime powers are permitted. - _Harvey P. Dale_, Apr 09 2021 at the suggestion of Sean A. Irvine %C A046395 See A373465 for the similar sequence where only distinct prime divisors are counted, but may occur to higher powers. - _M. F. Hasler_, Jun 06 2024 %H A046395 Harvey P. Dale, <a href="/A046395/b046395.txt">Table of n, a(n) for n = 1..500</a> %F A046395 Intersection of A002113 and A046387. %e A046395 505505 = 5 * 7 * 11 * 13 * 101. %t A046395 Select[Range[550000],PalindromeQ[#]&&PrimeNu[#]==PrimeOmega[#]==5&] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, Apr 09 2021 *) %Y A046395 Cf. A002113 (palindromes), A051270 (omega(.) = 5). %Y A046395 Cf. A046331 (palindromes with 5 prime factors counted with multiplicity), A373465 (counting only distinct prime divisors). %K A046395 nonn,base %O A046395 1,1 %A A046395 _Patrick De Geest_, Jun 15 1998 %E A046395 Corrected at the suggestion of Sean A. Irvine by _Harvey P. Dale_, Apr 09 2021 %E A046395 Name edited to avoid confusion by _M. F. Hasler_, Jun 06 2024