cp's OEIS Frontend

A333659 a(n) is the greatest number m not yet in the sequence such that the decimal expansions of n and of m have the same digits (up to order but with multiplicity).

%I A333659 #18 Sep 08 2020 13:57:57
%S A333659 0,1,2,3,4,5,6,7,8,9,10,11,21,31,41,51,61,71,81,91,20,12,22,32,42,52,
%T A333659 62,72,82,92,30,13,23,33,43,53,63,73,83,93,40,14,24,34,44,54,64,74,84,
%U A333659 94,50,15,25,35,45,55,65,75,85,95,60,16,26,36,46,56,66,76
%N A333659 a(n) is the greatest number m not yet in the sequence such that the decimal expansions of n and of m have the same digits (up to order but with multiplicity).
%C A333659 Leading 0's are ignored.
%C A333659 This sequence is a permutation of the nonnegative integers, which preserves the number of digits (A055642) and the sum of digits (A007953).
%C A333659 This sequence first differs from A321474 and A336956 for n = 101: a(101) = 110 whereas A321474(101) = A336956(101) = 101.
%H A333659 Rémy Sigrist, <a href="/A333659/b333659.txt">Table of n, a(n) for n = 0..10000</a>
%H A333659 Rémy Sigrist, <a href="/A333659/a333659.gp.txt">PARI program for A333659</a>
%H A333659 Rémy Sigrist, <a href="/A333659/a333659.png">Scatterplot of the first 1000000 terms</a>
%H A333659 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F A333659 a(10^n) = 10^n for any n >= 0.
%e A333659 For n = 255:
%e A333659 - there are three numbers with the same multiset of digits: 255, 525 and 552,
%e A333659 - so a(255) = 552,
%e A333659      a(525) = 525,
%e A333659      a(552) = 255.
%o A333659 (PARI) See Links section.
%Y A333659 See A333658, A337305 and A337598 for similar sequences.
%Y A333659 See A331274 for the binary variant.
%Y A333659 Cf. A007953, A055642, A321474, A336956.
%K A333659 nonn,look,base
%O A333659 0,3
%A A333659 _Rémy Sigrist_, Sep 02 2020