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.

A134336 Nonnegative integers n containing each digit between n's smallest and largest decimal digits.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 21, 22, 23, 32, 33, 34, 43, 44, 45, 54, 55, 56, 65, 66, 67, 76, 77, 78, 87, 88, 89, 98, 99, 100, 101, 102, 110, 111, 112, 120, 121, 122, 123, 132, 201, 210, 211, 212, 213, 221, 222, 223, 231, 232, 233, 234, 243, 312, 321, 322, 323
Offset: 1

Views

Author

Rick L. Shepherd, Oct 21 2007

Keywords

Comments

A032981 is a subsequence; the term 102 is the first positive integer not also in A032981. A171102 (pandigital numbers) and A033075 are subsequences. Union of A010785 (repdigits) and A108965.
a(n) = A178403(n) for n < 48. - Reinhard Zumkeller, May 27 2010
Equivalently, numbers with the property that the set of its decimal digits is a set of consecutive numbers. - Tanya Khovanova and Charles R Greathouse IV, Jul 31 2012

Crossrefs

Cf. A032981, A050278, A033075 (a subsequence), A010785, A108965.

Programs

  • PARI
    is(n)=my(v=vecsort(eval(Vec(Str(n))),,8));for(i=2,#v,if(v[i]!=1+v[i-1],return(0)));1 \\ Tanya Khovanova and Charles R Greathouse IV, Jul 31 2012
    
  • PARI
    is_A134336(n)={vecmax(n=Set(digits(n)))-vecmin(n)==#n-1} \\ M. F. Hasler, Dec 24 2014
    
  • Python
    def ok(n): d = sorted(set(map(int, str(n)))); return d[-1]-d[0]+1 == len(d)
    print([k for k in range(324) if ok(k)]) # Michael S. Branicky, Dec 12 2023

Formula

a(n) ~ n. - Charles R Greathouse IV, Sep 09 2011

Extensions

Edited by N. J. A. Sloane, Aug 06 2012