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 A357692 #26 Oct 13 2022 16:32:10
%S A357692 1,2,4,15,16,25,60,90,100,124,150,240,375,384,600,618,625,960,1536,
%T A357692 3330,3750,4650,5760,10000,10500,10752,15000,16384,17500,24576,25600,
%U A357692 40000,49500,62500,102400,139200,168750,198400,323280,526848,960000,1179648,1248000,1369125
%N A357692 Integers k such that A037278(k) is a term of A175252.
%H A357692 David A. Corneth, <a href="/A357692/b357692.txt">Table of n, a(n) for n = 1..81</a>
%e A357692 A037278(4) = 124, a term of A175252.
%e A357692 A037278(15) = 13515, a term of A175252.
%e A357692 A037278(16) = 124816, a term of A175252.
%e A357692 A037278(25) = 1525, a term of A175252.
%o A357692 (PARI) is(n, {u = 10^5}) = {my(e = eval(concat(concat([""], divisors(n))))); if(e % n != 0, return(0); ); my(oldu = u, s, d); u = min(e, u); s = ""; d = divisors(factor(e, u)); d = select(x -> x <= u, d); for(i = 1, #d, s=concat(s, Str(d[i])); if(eval(s) == e, return(1)); if(eval(s) > e, return(0)); ); is(n, 10*oldu); } \\ _David A. Corneth_, Oct 10 2022, adapted from _Michel Marcus_' isok at A175252
%Y A357692 Subsequence of A069872.
%Y A357692 Cf. A037278, A175252.
%K A357692 nonn,base
%O A357692 1,2
%A A357692 _Michel Marcus_, Oct 10 2022
%E A357692 More terms from _David A. Corneth_, Oct 10 2022