login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A052383 Numbers without 1 as a digit. 4
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

R. Zumkeller, Table of n, a(n) for n = 0..1000

FORMULA

a(0) = 0, a(n+1) = f(a(n)+1,f(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

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

CROSSREFS

Cf. A004176, A004720, A052404.

Sequence in context: A024657 A140281 A039077 * A110803 A109795 A132029

Adjacent sequences:  A052380 A052381 A052382 * A052384 A052385 A052386

KEYWORD

base,easy,nonn,changed

AUTHOR

Henry Bottomley, Mar 13 2000

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified May 25 12:01 EDT 2013. Contains 225647 sequences.