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.

A241176 Numbers n such that there is exactly one number m with m + (some digit of m) = n.

Original entry on oeis.org

0, 2, 4, 6, 8, 11, 13, 15, 17, 19, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 89, 91, 93, 95, 97, 99, 111, 113, 115, 117, 119, 121, 143, 165, 187, 221, 223, 225, 227, 229, 231, 243, 265, 287, 321, 333, 335, 337, 339, 341, 343, 365, 387, 421
Offset: 1

Views

Author

N. J. A. Sloane, Apr 23 2014

Keywords

Examples

			Since 10 = 5+5 = 10+0, there are two possibilities of writing 10 in the given way, therefore 10 is not in this list.
For numbers in A241175 = {1, 3, 5, 7, 9, 21, 43, 65, 87}, there is NO way of writing them in the given form, therefore they are not in this list.
		

References

  • Eric Angelini, Posting to Sequence Fans Mailing List, Apr 20 2014

Crossrefs

Programs

  • Maple
    See A241177.
  • Mathematica
    A241176[n_] := Module[{m, c = 0},
       Do[c = c + Count[m + Union[IntegerDigits[m]], n], {m, 0, n}]; c];
    Select[Range[0, 421], A241176[#] == 1 &] (* Robert Price, Mar 20 2019 *)
  • PARI
    is(n)={sum(i=0, min(n, 9), setsearch(Set(digits(n-i)), i)>0)==1||n==0} \\ M. F. Hasler, Apr 26 2014

Extensions

Example corrected by M. F. Hasler, Apr 26 2014