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 A248039 #18 Sep 08 2022 08:46:10 %S A248039 0,1,11,111,792,1111,1376,2174,2841,11111,11628,12168,12763,12841, %T A248039 14213,14228,14663,19842,24314,24679,24738,24786,26439,26731,26938, %U A248039 29126,39117,39228,49326,64113,76983,79328,83694,83712,83764,86429,87164,89174,92387,92476,93711,94831,98174 %N A248039 Numbers n such that n*A007954(n) contains the same distinct digits as n. %C A248039 A002275 is a subsequence, thus this sequence is infinite. %o A248039 (PARI) %o A248039 for(n=0, 10^6, d=digits(n); p=prod(i=1, #d, d[i]); if(vecsort(digits(n), , 8)==vecsort(digits(n*p), , 8), print1(n, ", "))) %o A248039 (Magma) [n: n in [0..10^5] | Set(Intseq(n*&*Intseq(n))) eq Set(Intseq(n))]; // _Bruno Berselli_, Oct 09 2014 %Y A248039 Cf. A002275 (repunits), A007954 (digit product). %Y A248039 Cf. A247887 (similar, with n + digit sum), A247888 (similar, with n + digit product). %K A248039 nonn,base %O A248039 1,3 %A A248039 _Derek Orr_, Sep 30 2014