(MAGMAMagma) [n: n in [0..20000000] | #Set(Intseq(n^2)) eq 2]; // Vincenzo Librandi, Nov 04 2014
(MAGMAMagma) [n: n in [0..20000000] | #Set(Intseq(n^2)) eq 2]; // Vincenzo Librandi, Nov 04 2014
reviewed
approved
proposed
reviewed
editing
proposed
proposed
approved
editing
proposed
Numbers n k such that nk^2 contains exactly 2 different distinct digits.
10^n, k, 2*10^n, k, 3*10^n k for n k > 0 are terms. - Chai Wah Wu, Dec 17 2021
a(n) = ((n-1) mod 3 + 1)*10^(ceilceiling(n/3)-7) for n >= 34 (conjectured). - Chai Wah Wu, Dec 17 2021
26 is in the sequence because 26^2 = 676 contains exactly 2 different distinct digits.
proposed
editing
editing
proposed
10^n, 2*10^n, 3*10^n for n > 0 are terms. - Chai Wah Wu, Dec 17 2021
a(n) = ((n-1) mod 3 + 1)*10^(ceil(n/3)-7) for n >= 34 (conjectured). - _Chai Wah Wu_, Dec 17 2021