login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A052383 Numbers without 1 as a digit. 24
0, 2, 3, 4, 5, 6, 7, 8, 9, 20, 22, 23, 24, 25, 26, 27, 28, 29, 30, 32, 33, 34, 35, 36, 37, 38, 39, 40, 42, 43, 44, 45, 46, 47, 48, 49, 50, 52, 53, 54, 55, 56, 57, 58, 59, 60, 62, 63, 64, 65, 66, 67, 68, 69, 70, 72, 73, 74, 75, 76, 77, 78, 79, 80, 82, 83, 84, 85, 86, 87, 88, 89 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Index entries for 10-automatic sequences.

FORMULA

a(1) = 1, a(n+1) = f(a(n)+1,a(n)+1) where f(x,y) = if x<10 and x<>1 then y else if x mod 10 = 1 then f(y+1,y+1) else f(floor(x/10),y). - Reinhard Zumkeller, Mar 02 2008

a(n) = replace all nonzero digits d by d+1 in base-9 representation of n-1. - Reinhard Zumkeller, Oct 07 2014

MAPLE

M:= 3: # to get all terms with up to M digits

B:= {$2..9}: A:= B union {0}:

for m from 1 to M do

B:= map(b -> seq(10*b+j, j={0, $2..9}), B);

A:= A union B;

od:

sort(convert(A, list)); # Robert Israel, Jan 11 2016

# second program:

A052383 := proc(n)

      option remember;

      if n = 1 then

        0;

    else

        for a from procname(n-1)+1 do

            if nops(convert(convert(a, base, 10), set) intersect {1}) = 0 then

                return a;

            end if;

        end do:

    end if;

end proc: # R. J. Mathar, Jul 31 2016

# third Maple program:

a:= proc(n) local l, m; l, m:= 0, n-1;

      while m>0 do l:= (d->

        `if`(d=0, 0, d+1))(irem(m, 9, 'm')), l

      od; parse(cat(l))/10

    end:

seq(a(n), n=1..100);  # Alois P. Heinz, Aug 01 2016

MATHEMATICA

ban1Q[n_]:=FreeQ[IntegerDigits[n], 1]==True; Select[Range[0, 89], ban1Q[#] &] (* Jayanta Basu, May 17 2013 *)

PROG

(MAGMA) [ n: n in [0..89] | not 1 in Intseq(n) ];  // Bruno Berselli, May 28 2011

(sh) seq 0 1000 | grep -v 1; # Joerg Arndt, May 29 2011

(PARI) a(n)=my(v=digits(n, 9)); for(i=1, #v, if(v[i], v[i]++)); subst(Pol(v), 'x, 10) \\ Charles R Greathouse IV, Oct 04 2012

(Haskell)

a052383 = f . subtract 1 where

   f 0 = 0

   f v = 10 * f w + if r > 0 then r + 1 else 0  where (w, r) = divMod v 9

-- Reinhard Zumkeller, Oct 07 2014

CROSSREFS

Cf. A004176, A004720.

Cf. A052382 (without 0), A052404 (without 2), A052405 (without 3), A052406 (without 4), A052413 (without 5), A052414 (without 6), A052419 (without 7), A052421 (without 8), A007095 (without 9).

Cf. A248518, A248519.

Cf. A011531 (complement).

Sequence in context: A140281 A039077 A247803 * A110803 A109795 A248500

Adjacent sequences:  A052380 A052381 A052382 * A052384 A052385 A052386

KEYWORD

base,easy,nonn

AUTHOR

Henry Bottomley, Mar 13 2000

EXTENSIONS

Offset changed by Reinhard Zumkeller, Oct 07 2014

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 18 16:27 EST 2020. Contains 331011 sequences. (Running on oeis4.)