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 A084434 #23 Aug 27 2025 10:06:20 %S A084434 2,3,4,5,6,7,8,9,11,12,15,18,20,21,22,24,26,27,28,30,33,36,39,40,42, %T A084434 44,45,46,48,50,51,54,55,57,60,62,63,64,66,68,69,70,72,75,77,78,80,81, %U A084434 82,84,86,87,88,90,93,96,99,102,105,108,111,114,117,120,123,126,129,132 %N A084434 Numbers whose digit permutations have GCD > 1. %C A084434 Numbers k such that there is a number d>1 which divides every number that can be obtained by permuting the digits of k. - _N. J. A. Sloane_, Aug 27 2020 %C A084434 Theorem. The sequence consists of: (1) A008585 (multiples of 3), (2) A014263 (numbers with all digits even), (3) A014181 (numbers with all digits equal), (4) numbers with all digits 5 or 0, (5) numbers with all digits 7 or 0, (6) numbers with 6k digits, all of which are 1 or 8, and (7) numbers with 6k digits, all of which are 2 or 9. - _David Wasserman_, May 07 2004 %e A084434 72 is in the sequence because 72 and 27 are both divisible by 9. %t A084434 Select[Range[0, 150], GCD @@ FromDigits /@ Permutations[IntegerDigits[#]] > 1 &] (* _Harvey P. Dale_, Jan 12 2011 *) %Y A084434 Cf. A008585, A014181, A014263, A071249. %Y A084434 Subsequence of A084433 which contains for example 592 which is not in here. %K A084434 base,nonn,changed %O A084434 1,1 %A A084434 _Amarnath Murthy_, Jun 02 2003 %E A084434 More terms from _David Wasserman_, May 07 2004 %E A084434 Initial zero removed, Harvey P. Dale, Jan 14 2011 %E A084434 Entry revised by _N. J. A. Sloane_, Aug 27 2020