A342851 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

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.

MATHEMATICA

Union@ IntegerReverse[Range[0, 100]]

PROG

(Python)

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

CROSSREFS

Cf. A004086. Essentially the same as A067251.

Sequence in context: A336557 A335235 A023804 * A067251 A209931 A052382

Adjacent sequences: A342848 A342849 A342850 * A342852 A342853 A342854

KEYWORD

nonn,base,easy

AUTHOR

Michael De Vlieger, Mar 24 2021

STATUS

approved