cp's OEIS Frontend

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.

Showing 1-3 of 3 results.

A321800 Delete the decimal digits of n that appear exactly once; write -1 if all digits disappear.

Original entry on oeis.org

-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 11, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 22, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 33, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 44, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 55, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 66, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 77, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 88, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 99, 0, 11, -1, -1, -1, -1, -1, -1, -1, -1, 11, 111, 11, 11, 11, 11, 11, 11, 11, 11, -1, 11, 22, -1, -1, -1, -1, -1, -1, -1, -1, 11, -1, 33, -1, -1, -1, -1, -1, -1, -1, 11, -1, -1, 44, -1, -1, -1, -1, -1, -1, 11, -1, -1, -1, 55, -1, -1, -1, -1, -1, 11, -1, -1, -1, -1, 66, -1, -1, -1, -1, 11, -1, -1, -1, -1, -1, 77, -1, -1, -1, 11, -1, -1, -1, -1, -1, -1, 88, -1, -1, 11, -1, -1, -1, -1, -1, -1, -1, 99
Offset: 0

Views

Author

Chai Wah Wu, Nov 19 2018

Keywords

Comments

A companion sequence to A320485.
Digits that appear exactly once in n are erased. Leading zeros are erased unless the result is 0. If all digits are erased, we write -1 for the result (A321797 is another version, which uses 0 for the empty string).
More than the usual number of terms are shown in order to reach some interesting examples.

Examples

			12321 becomes 1221, 1123 becomes 11, 11231 becomes 111, and 100223 becomes 22 (as we don't accept leading zeros). Note that 12345 disappears immediately and we get -1.

Links

Crossrefs

Cf. A320485, A321797.

Programs

  • Python
    def A321800(n):
    return (lambda x: int(x) if x != '' else -1)(''.join(d if str(n).count(d) != 1 else '' for d in str(n)))

A321803 Keep only consecutive identical decimal digits of n; write 0 if all digits disappear.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 22, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 33, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 44, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 55, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 66, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 77, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 88, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 99, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11, 111, 11, 11, 11, 11, 11, 11, 11, 11, 0, 0, 22, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 33, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 44, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 55, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 66, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 77, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 88, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 99
Offset: 0

Views

Author

Chai Wah Wu, Nov 19 2018

Keywords

Comments

Consecutive identical digits of n are kept. Leading zeros are erased unless the result is 0. If all digits are erased, we write 0 for the result (A321804 is another version, which uses -1 for the empty string).
More than the usual number of terms are shown in order to reach some interesting examples. Agrees with A321797 for n < 121.
Differs from A321538 for the first time at n = 11011. - Chai Wah Wu, Nov 29 2018

Examples

			123321 becomes 33, 1123 becomes 11, 112331 becomes 1133, and 100223 becomes 22 (as we don't accept leading zeros). Note that 12321 disappears immediately and we get 0.

Crossrefs

Cf. A320486, A321800, A321797, A321538.

Programs

  • Mathematica
    Array[FromDigits[Join @@ Select[Split@ IntegerDigits@ #, Length@ # >= 2 &] /. {} -> {0}] &, 200, 0] (* Michael De Vlieger, Nov 20 2018 *)
  • Python
    from re import split
def A321803(n):
    return int('0'+''.join(d if len(d) != 1 else '' for d in split('(0+)|(1+)|(2+)|(3+)|(4+)|(5+)|(6+)|(7+)|(8+)|(9+)',str(n)) if d != '' and d != None))

A321804 Keep only consecutive identical decimal digits of n; write -1 if all digits disappear.

Original entry on oeis.org

-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 11, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 22, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 33, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 44, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 55, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 66, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 77, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 88, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 99, 0, -1, -1, -1, -1, -1, -1, -1, -1, -1, 11, 111, 11, 11, 11, 11, 11, 11, 11, 11, -1, -1, 22, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 33, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 44, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 55, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 66, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 77, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 88, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 99
Offset: 0

Views

Author

Chai Wah Wu, Nov 19 2018

Keywords

Comments

Consecutive identical digits of n are kept. Leading zeros are erased unless the result is 0. If all digits are erased, we write -1 for the result (A321803 is another version, which uses 0 for the empty string).
More than the usual number of terms are shown in order to reach some interesting examples. Agrees with A321800 for n < 121.

Examples

			123321 becomes 33, 1123 becomes 11, 112331 becomes 1133, and 100223 becomes 22 (as we don't accept leading zeros). Note that 12321 disappears immediately and we get -1.

Crossrefs

Cf. A320486, A321800, A321797, A321800, A321803.

Programs

  • Mathematica
    Array[If[# == {}, -1, FromDigits@ #] &@ Apply[Join, Select[Split@ IntegerDigits[#], Length@ # > 1 &]] &, 200] (* Michael De Vlieger, Nov 23 2018 *)
  • Python
    from re import split
def A321804(n):
    return (lambda x: int(x) if x != '' else -1)(''.join(d if len(d) != 1 else '' for d in split('(0+)|(1+)|(2+)|(3+)|(4+)|(5+)|(6+)|(7+)|(8+)|(9+)',str(n)) if d != '' and d != None))
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.