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 A257760 #68 Mar 02 2019 01:55:31 %S A257760 1,1488,3381,14889,18489,181965,262989,338646,358489,367589,437189, %T A257760 438329,479285,781839,964941,1456589,1763954,2579285,2868489,3365285, %U A257760 3419389,3451988,3584889,3625619,4378829,4653989,6868877,7295986,9548479,14529839,14534488 %N A257760 Zeroless numbers n such that the products of the decimal digits of n and n^2 coincide. %C A257760 It is unknown if this sequence is infinite. %C A257760 Number of terms < 10^n: 1, 1, 1, 3, 5, 15, 29, 75, 211, 583, 1694, ..., . - _Robert G. Wilson v_, May 25 2015 %C A257760 Also nontrivial numbers n such that the products of the decimal digits of n and n^2 are equal. Trivial solutions are any number which contains a zero in its decimal expansion. - _Robert G. Wilson v_, May 11 2015 %H A257760 Robert G. Wilson v, <a href="/A257760/b257760.txt">Table of n, a(n) for n = 1..1747</a> (first 75 terms from Pieter Post) %e A257760 1488 is in the sequence since 1488^2 = 2214144 and we have 256 = 1*4*8*8 = 2*2*1*4*1*4*4. %e A257760 3381 is in the sequence because 3381^2 = 11431161 and 72 = 3*3*8*1 = 1*1*4*3*1*1*6*1. %t A257760 fQ[n_] := Times @@ IntegerDigits[n] == Times @@ IntegerDigits[n^2] > 0; Select[ Range@ 10000000, fQ] (* _Robert G. Wilson v_, May 07 2015 *) %o A257760 (PARI) isok(n) = (d = digits(n)) && vecmin(d) && (dd = digits(n^2)) && (prod(k=1, #d, d[k]) == prod(k=1, #dd, dd[k])); \\ _Michel Marcus_, May 07 2015 %Y A257760 Subsequence of A052040. %Y A257760 Cf. A000290, A007954, A029793, A052382, A257763. %K A257760 nonn,base %O A257760 1,2 %A A257760 _Pieter Post_, May 07 2015