A342851 Remove duplicates in the decimal digit-reversal of n.

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19, 21, 22, 23, 24, 25, 26, 27, 28, 29, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 48, 49, 51, 52, 53, 54, 55, 56, 57, 58, 59, 61, 62, 63, 64, 65, 66, 67, 68, 69, 71, 72, 73, 74, 75, 76, 77, 78, 79, 81, 82

Offset: 1

Author

Michael De Vlieger, Mar 24 2021

Keywords

• nonn
• base
• easy

Comments

Primitive terms in A004086.

Corresponds with A023804 for 1 <= n <= 73. The term 81 in this sequence is "100" in base 9, in which 2 digits are the same, therefore 81 does not appear in A023804.

0 plus integers that are not a multiple of 10. - Chai Wah Wu, Mar 25 2021

Differs "in substance" from A209931, because e.g. this sequence contains 214 and 214 is not in A209931 (because 107|214 and 107 contains a zero). - R. J. Mathar, Jul 29 2021

Differs from the finite sequence A023804. - R. J. Mathar, Jul 07 2023

Links

• Michael De Vlieger, Table of n, a(n) for n = 1..10000
• Dana G. Korssjoen, Biyao Li, Stefan Steinerberger, Raghavendra Tripathi, and Ruimin Zhang, Finding Structure in Sequences of Real Numbers via Graph Theory: a Problem List, arXiv:2012.04625 [math.CO], 2020.

Crossrefs

Cf. A004086. Essentially the same as A067251.

Programs

Mathematica

Union@ IntegerReverse[Range[0, 100]]

Python

A342851_list = [d for d in range(10**3) if d == 0 or d % 10] # Chai Wah Wu, Mar 25 2021