login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A052419 Numbers without 7 as a digit. 16

%I #40 Sep 08 2022 08:44:59

%S 0,1,2,3,4,5,6,8,9,10,11,12,13,14,15,16,18,19,20,21,22,23,24,25,26,28,

%T 29,30,31,32,33,34,35,36,38,39,40,41,42,43,44,45,46,48,49,50,51,52,53,

%U 54,55,56,58,59,60,61,62,63,64,65,66,68,69,80,81,82,83,84,85,86,88,89

%N Numbers without 7 as a digit.

%H Reinhard Zumkeller, <a href="/A052419/b052419.txt">Table of n, a(n) for n = 1..10000</a>

%H M. F. Hasler, <a href="/wiki/Numbers_avoiding_certain_digits">Numbers avoiding certain digits</a> OEIS wiki, Jan 12 2020.

%H <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>.

%F a(n) = replace digits d > 6 by d + 1 in base-9 representation of n - 1. - _Reinhard Zumkeller_, Oct 07 2014

%F Sum_{n>1} 1/a(n) = A082836 = 22.493475... (Kempner series). - _Bernard Schott_, Jan 12 2020, edited by _M. F. Hasler_, Jan 13 2020

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

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

%p `if`(d<7, d, d+1))(irem(m, 9, 'm')), l

%p od; parse(cat(l))/10

%p end:

%p seq(a(n), n=1..100); # _Alois P. Heinz_, Aug 01 2016

%t Select[Range[100],DigitCount[#,10,7]==0&] (* _Harvey P. Dale_, Aug 23 2011 *)

%o (Magma) [ n: n in [0..89] | not 7 in Intseq(n) ]; // _Bruno Berselli_, May 28 2011

%o (sh) seq 0 1000 | grep -v 7; # _Joerg Arndt_, May 29 2011

%o (Haskell)

%o a052419 = f . subtract 1 where

%o f 0 = 0

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

%o -- _Reinhard Zumkeller_, Oct 07 2014

%o (PARI) lista(nn)=for (n=0, nn, if (!vecsearch(vecsort(digits(n),,8), 7), print1(n, ", "));); \\ _Michel Marcus_, Feb 22 2015

%o (PARI) /* See OEIS wiki page for more programs. */

%o apply( {A052419(n)=fromdigits(apply(d->d+(d>6),digits(n-1,9)))}, [1..99]) \\ a(n)

%o select( {is_A052419(n)=!setsearch(Set(digits(n)),7)}, [0..99]) \\ used in A038615

%o next_A052419(n, d=digits(n+=1))={for(i=1,#d, d[i]==7&&return((1+n\d=10^(#d-i))*d)); n} \\ least a(k) > n. Used in A038615. - _M. F. Hasler_, Jan 11 2020

%Y Cf. A004182, A004726, A038615 (subset of primes), A082836 (Kempner series).

%Y Cf. A052382 (without 0), A052383 (without 1), A052404 (without 2), A052405 (without 3), A052406 (without 4), A052413 (without 5), A052414 (without 6), A052421 (without 8), A007095 (without 9).

%K base,easy,nonn

%O 1,3

%A _Henry Bottomley_, Mar 13 2000

%E Offset changed by _Reinhard Zumkeller_, Oct 07 2014

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 10 13:53 EDT 2024. Contains 372387 sequences. (Running on oeis4.)