A336956 -id:A336956 - 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).

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, 62, 72, 82, 92, 30, 13, 23, 33, 43, 53, 63, 73, 83, 93, 40, 14, 24, 34, 44, 54, 64, 74, 84, 94, 50, 15, 25, 35, 45, 55, 65, 75, 85, 95, 60, 16, 26, 36, 46, 56, 66, 76

Offset: 0

Rémy Sigrist, Sep 02 2020

Leading 0's are ignored.
This sequence is a permutation of the nonnegative integers, which preserves the number of digits (A055642) and the sum of digits (A007953).
This sequence first differs from A321474 and A336956 for n = 101: a(101) = 110 whereas A321474(101) = A336956(101) = 101.

			For n = 255:
- there are three numbers with the same multiset of digits: 255, 525 and 552,
- so a(255) = 552,
     a(525) = 525,
     a(552) = 255.

Rémy Sigrist, Table of n, a(n) for n = 0..10000
Rémy Sigrist, PARI program for A333659
Rémy Sigrist, Scatterplot of the first 1000000 terms
Index entries for sequences that are permutations of the natural numbers

See A333658, A337305 and A337598 for similar sequences.
See A331274 for the binary variant.
Cf. A007953, A055642, A321474, A336956.

PARI
```
See Links section.
```

a(10^n) = 10^n for any n >= 0.

A352152 Reverse each run of consecutive nonzero digits in the decimal expansion of n.

Original entry on oeis.org

Offset: 0

Rémy Sigrist, Mar 06 2022

This sequence is a self-inverse permutation of the nonnegative integers.
This sequence first differs from A321474 for n = 102: a(102) = 102 whereas A321474(102) = 201.
This sequence first differs from A333659 for n = 101: a(101) = 101 whereas A333659(101) = 110.
This sequence first differs from A336956 for n = 102: a(102) = 102 whereas A336956(102) = 201.

			For n = 1024:
- we have two runs of consecutive nonzero digits: "1" and "24",
- the reverse of "1" is "1", that of "24" is "42",
- so a(1024) = 1042.

Cf. A321474, A333659, A336956.

sub a { my $v = shift; $v =~ s/[1-9]+/reverse($&)/ge; return $v; }

from itertools import groupby
def A352152(n): return int(''.join(''.join(list(g) if k else list(g)[::-1]) for k, g in groupby(str(n),key=lambda x:x =='0'))) # Chai Wah Wu, Mar 08 2022

a(10*n) = 10*a(n).

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).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula