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 A245386 #16 May 22 2025 10:21:39 %S A245386 164,195,265,498,1664,1995,2665,4847,4998,6545,7424,16664,19995,21775, %T A245386 24996,26665,43243,49998,86486,148480,166664,175150,199995,217775, %U A245386 249996,266665,368180,484847,499998,654545,742424,1001001,1081075,1216216,1249992,1297290,1451850,1471468,1481477 %N A245386 Numbers in A245385 where P, Q, R, and S are all distinct. %C A245386 This sequence does not contain any repdigits, unlike A245385. %e A245386 4*84847 = 48484*7 = 339388. Thus 484847 is a member of this sequence. %o A245386 (Python) %o A245386 for n in range(1,10**7): %o A245386 s = str(n) %o A245386 count = 0 %o A245386 for i in range(1,len(s)): %o A245386 if i != len(s) - i: %o A245386 if int(s[:i]) != int(s[len(s)-i:]): %o A245386 num = int(s[:i])*int(s[i:]) %o A245386 if num != 0: %o A245386 if num == int(s[:len(s)-i])*int(s[len(s)-i:]): %o A245386 count += 1 %o A245386 break %o A245386 if count > 0: %o A245386 print(n,end=', ') %Y A245386 Cf. A245385, A245364. %Y A245386 Cf. A262743 (predestined numbers). %K A245386 nonn,base %O A245386 1,1 %A A245386 _Derek Orr_, Jul 20 2014