A011533 -id:A011533 - cp's OEIS frontend

A121023 Multiples of 3 containing a 3 in their decimal representation.

3, 30, 33, 36, 39, 63, 93, 123, 132, 135, 138, 153, 183, 213, 231, 234, 237, 243, 273, 300, 303, 306, 309, 312, 315, 318, 321, 324, 327, 330, 333, 336, 339, 342, 345, 348, 351, 354, 357, 360, 363, 366, 369, 372, 375, 378, 381, 384, 387, 390, 393, 396, 399

Offset: 1

Reinhard Zumkeller, Jul 21 2006

Intersection of A008585 and A011533.

The graph of this sequence is (roughly) self-similar: it has the same appearance when the scale is multiplied by 10. - M. F. Hasler, Mar 09 2014

M. F. Hasler, Table of n, a(n) for n = 1..3440
Index entries for 10-automatic sequences.

Cf. A121041, A011531, A121022, A121024, A121025, A121026, A121027, A121028, A121029, A121030, A121031, A121032, A121033, A121034, A121035, A121036, A121037, A121038, A121039, A121040.

Select[3*Range[500], MemberQ[IntegerDigits[#],3] &] (* Paolo Xausa, Feb 25 2024 *)

is(n)=!(n%3)&&setsearch(Set(digits(n)),3) \\ M. F. Hasler, Mar 09 2014

c=0;forstep(n=3,3e4,3,is(n)&write("/tmp/b121023.txt",c++" "n))

a(n) ~ 3n. - Charles R Greathouse IV, Mar 31 2016

Typo in comment fixed by Reinhard Zumkeller, May 01 2011

A011532 Numbers that contain a 2.

Original entry on oeis.org

2, 12, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 32, 42, 52, 62, 72, 82, 92, 102, 112, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 132, 142, 152, 162, 172, 182, 192, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214

Offset: 1

N. J. A. Sloane

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Index entries for 10-automatic sequences.

Numbers that contain a digit k: A011531 (k=1), A011533 (k=3), A011534 (k=4), A011535 (k=5), A011536 (k=6), A011537 (k=7), A011538 (k=8), A011539 (k=9), A011540 (k=0).

Filtered([1..220],n->2 in ListOfDigits(n)); # Muniru A Asiru, Feb 23 2019

a011532 n = a011532_list !! (n-1)
a011532_list = filter ((elem '2') . show) [0..]
-- Reinhard Zumkeller, Apr 10 2015

[n: n in [0..500] | 2 in Intseq(n)]; // Vincenzo Librandi, Jan 11 2016

Select[Range[600] - 1, DigitCount[#, 10, 2]>0 &] (* Vincenzo Librandi, Jan 11 2016 *)

a(n) ~ n. - Charles R Greathouse IV, Feb 12 2017

A011534 Numbers that contain a 4.

Original entry on oeis.org

4, 14, 24, 34, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 54, 64, 74, 84, 94, 104, 114, 124, 134, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 154, 164, 174, 184, 194, 204, 214, 224, 234, 240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 254

Offset: 1

N. J. A. Sloane

Vincenzo Librandi, Table of n, a(n) for n = 1..6878
Index entries for 10-automatic sequences.

Numbers that contain a digit k: A011531 (k=1), A011532 (k=2), A011533 (k=3), A011535 (k=5), A011536 (k=6), A011537 (k=7), A011538 (k=8), A011539 (k=9), A011540 (k=0).

Filtered([1..260],n->4 in ListOfDigits(n)); # Muniru A Asiru, Feb 23 2019

Select[Range[200], DigitCount[#, 10, 4]>0 &] (* Vincenzo Librandi, Feb 14 2017 *)

is(n)=!!setsearch(Set(digits(n)), 4) \\ Charles R Greathouse IV, Feb 12 2017

a(n) ~ n. - Charles R Greathouse IV, Feb 12 2017

A016189 a(n) = 10^n - 9^n.

Original entry on oeis.org

0, 1, 19, 271, 3439, 40951, 468559, 5217031, 56953279, 612579511, 6513215599, 68618940391, 717570463519, 7458134171671, 77123207545039, 794108867905351, 8146979811148159, 83322818300333431, 849905364703000879, 8649148282327007911, 87842334540943071199, 890581010868487640791

Offset: 0

N. J. A. Sloane

Almost all numbers contain any given sequence of digits (in any base) [Theorem 143 of Hardy and Wright]. a(7) = 5217031, more than 52% of the numbers < 10^7 contain any given nonzero decimal digit. - Frank Ellermann, May 30 2001
a(n) gives the number of integers from 0 to 10^n-1 which contain (at least) any one given decimal digit except 0. - Michael Taktikos, Aug 24 2004
These are the numerators of a(n)=(integral{x=0 to 0.2} (1-0.5*x)^n dx). E.g., a(3)=3439/20000. The denominators are b(n)=5*(n+1)*10^n. E.g., b(3)=20000. - Al Hakanson (hawkuu(AT)excite.com), Feb 22 2004
Binomial transforms of sequences defined by a(n)=(C+1)^n-C^n are the sequences (C+2)^n-(C+1)^n. The binomial transform of this here is in A016195, for example. - R. J. Mathar, Nov 27 2008
First differences are given in A088924. - M. F. Hasler, May 04 2015

G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Press, 1979, th. 143

Vincenzo Librandi, Table of n, a(n) for n = 0..130
Alexander Bogomolny, Almost every integer has a digit 3 in it
John Elias, Illustration of Initial Terms
James Grime, 3 is everywhere, Numberphile video
Index entries for linear recurrences with constant coefficients, signature (19, -90).

Base 2: A000225, 3: A001047, 4: A005061, 5: A005060, 6: A005062, base 7: A016169, 8: A016177, 9: A016185 11: A016195 12: A016197.
Equals A155671 - 1.
Cf. A011557, A011533.

a016189 n = 10 ^ n - 9 ^ n
a016189_list = 0 : zipWith (+) (map (* 9) a016189_list) a011557_list
-- Reinhard Zumkeller, Apr 03 2015

[10^n - 9^n: n in [0..20]]; // Vincenzo Librandi, Apr 26 2011

f[n_]:=10^n-9^n;f[Range[0,40]] (* Vladimir Joseph Stephan Orlovsky, Feb 14 2011 *)

a(n)=10^n-9^n \\ M. F. Hasler, May 04 2015

G.f.: x/((1-9x)(1-10x)).
a(0) = 0, a(1) = 1, then a(n+1) = 9*a(n) + 10^n.
a(n) = 19*a(n-1) - 90*a(n-2), n > 1; a(0)=0, a(1)=1. - Philippe Deléham, Jan 01 2009
E.g.f.: e^(10*x) - e^(9*x). - Mohammad K. Azarian, Jan 14 2009

A052405 Numbers without 3 as a digit.

Original entry on oeis.org

0, 1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 40, 41, 42, 44, 45, 46, 47, 48, 49, 50, 51, 52, 54, 55, 56, 57, 58, 59, 60, 61, 62, 64, 65, 66, 67, 68, 69, 70, 71, 72, 74, 75, 76, 77, 78, 79, 80, 81, 82, 84, 85, 86, 87, 88, 89

Offset: 1

Henry Bottomley, Mar 13 2000

This sequence also represents the minimal number of straight lines of a covering tree to cover n X n points arranged in a symmetrical grid. - Marco Ripà, Sep 20 2018

			22 has no 3s among its digits, hence it is in the sequence.
23 has one 3 among its digits, hence it is not in the sequence.

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
M. F. Hasler, Numbers avoiding certain digits, OEIS Wiki, Jan 12 2020.
Index entries for 10-automatic sequences.

Cf. A004178, A004722, A038611 (subset of primes), A082832 (Kempner series).
Cf. A052382 (without 0), A052383 (without 1), A052404 (without 2), A052406 (without 4), A052413 (without 5), A052414 (without 6), A052419 (without 7), A052421 (without 8), A007095 (without 9).
Cf. A011533 (complement).

a052405 = f . subtract 1 where
   f 0 = 0
   f v = 10 * f w + if r > 2 then r + 1 else r  where (w, r) = divMod v 9
-- Reinhard Zumkeller, Oct 07 2014

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

a:= proc(n) local l, m; l, m:= 0, n-1;
      while m>0 do l:= (d->
        `if`(d<3, d, 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

Select[Range[0, 89], DigitCount[#, 10, 3] == 0 &] (* Alonso del Arte, Oct 16 2012 *)

is(n)=n=digits(n);for(i=1,#n,if(n[i]==3,return(0)));1 \\ Charles R Greathouse IV, Oct 16 2012
apply( {A052405(n)=fromdigits(apply(d->d+(d>2),digits(n-1,9)))}, [1..99]) \\ a(n)
next_A052405(n, d=digits(n+=1))={for(i=1, #d, d[i]==3&& return((1+n\d=10^(#d-i))*d)); n} \\ least a(k) > n. Used in A038611. \\ M. F. Hasler, Jan 11 2020

from gmpy2 import digits
def A052405(n): return int(digits(n-1,9).translate(str.maketrans('345678','456789'))) # Chai Wah Wu, Jun 28 2025

seq 0 1000 | grep -v 3; # Joerg Arndt, May 29 2011

a(n) >> n^k with k = log(10)/log(9) = 1.0479.... - Charles R Greathouse IV, Oct 16 2012
a(n) = replace digits d > 2 by d + 1 in base-9 representation of n - 1. - Reinhard Zumkeller, Oct 07 2014
Sum_{n>1} 1/a(n) = A082832 = 20.569877... (Kempner series). - Bernard Schott, Jan 12 2020, edited by M. F. Hasler, Jan 14 2020

Offset changed by Reinhard Zumkeller, Oct 07 2014

A256786 Numbers which are divisible by prime(d) for all digits d in their decimal representation.

Original entry on oeis.org

12, 14, 42, 55, 154, 222, 228, 714, 1122, 1196, 1212, 1414, 2112, 2142, 2262, 3355, 4144, 4242, 5335, 5544, 5555, 6162, 9499, 11112, 11144, 11214, 11424, 11466, 11622, 11818, 11914, 12222, 12882, 14112, 15554, 16666, 21216, 21222, 21252, 21888, 22122, 22212

Offset: 1

Eric Angelini and Reinhard Zumkeller, Apr 10 2015

All terms are zerofree, cf. A052382;
there is no term containing digits 1 and 3 simultaneously;
a(n) contains at least one digit 1 iff a(n) is even, cf. A011531, A005843;
a(n) contains at least one digit 2 iff a(n) mod 3 = 0, cf. A011532, A008585;
a(n) contains at least one digit 3 iff a(n) mod 10 = 5, cf. A011533, A017329;
A020639(a(n)) <= 23.
The equivalent in base 2 is the empty sequence, in base 3 it is A191681\{0}; see A256874-A256879 for the base 4 - base 9 variant, and A256870 for a variant where digits 0 are allowed but divisibility by prime(d+1) is required instead. - M. F. Hasler, Apr 11 2015

			Smallest terms containing the nonzero decimal digits:
.  d | prime(d) |  n | a(n)
. ---+----------+--------------------------
.  1 |       2  |  1 |   12 = 2^2 * 3
.  2 |       3  |  1 |   12 = 2^2 * 3
.  3 |       5  | 16 | 3355 = 5 * 11 * 61
.  4 |       7  |  2 |   14 = 2 * 7
.  5 |      11  |  4 |   55 = 5 * 11
.  6 |      13  | 10 | 1196 = 2^2 * 13 * 23
.  7 |      17  |  8 |  714 = 2 * 3 * 7 * 17
.  8 |      19  |  7 |  228 = 2^2 * 3 * 19
.  9 |      23  | 10 | 1196 = 2^2 * 13 * 23 .

Lars Blomberg and Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Éric Angelini, Divisibility by primes, SeqFan list, Apr 10 2015.
Index entries for 10-automatic sequences.

Cf. A000040, A005843, A008585, A011531, A011532, A011533, A017329, A020639, A052382, A256874-A256879, A256882-A256884, A256865-A256870.

a256786 n = a256786_list !! (n-1)
a256786_list = filter f a052382_list where
   f x = g x where
     g z = z == 0 || x `mod` a000040 d == 0 && g z'
           where (z', d) = divMod z 10

Select[Range@22222,FreeQ[IntegerDigits[#],0]&&Total[Mod[#,Prime[IntegerDigits[#]]]]==0&] (* Ivan N. Ianakiev, Apr 11 2015 *)

is_A256786(n)=!for(i=1,#d=Set(digits(n)),(!d[i]||n%prime(d[i]))&&return) \\ M. F. Hasler, Apr 11 2015

primes = [1, 2, 3, 5, 7, 11, 13, 17, 19, 23]
def ok(n):
    s = str(n)
    return "0" not in s and all(n%primes[int(d)] == 0 for d in s)
print([k for k in range(22213) if ok(k)]) # Michael S. Branicky, Dec 14 2021

A293869 Square array whose n-th row lists all numbers having n as a substring, n >= 1; read by falling antidiagonals.

Original entry on oeis.org

1, 10, 2, 11, 12, 3, 12, 20, 13, 4, 13, 21, 23, 14, 5, 14, 22, 30, 24, 15, 6, 15, 23, 31, 34, 25, 16, 7, 16, 24, 32, 40, 35, 26, 17, 8, 17, 25, 33, 41, 45, 36, 27, 18, 9, 18, 26, 34, 42, 50, 46, 37, 28, 19, 10, 19, 27, 35, 43, 51, 56, 47, 38, 29, 100, 11

Offset: 1

M. F. Hasler, Oct 18 2017

			The array starts:
   [ 1  10  11  12  13  14  15  16  17  18  19  21  31 ...] = A011531
   [ 2  12  20  21  22  23  24  25  26  27  28  29  32 ...] = A011532
   [ 3  13  23  30  31  32  33  34  35  36  37  38  39 ...] = A011533
   [ 4  14  24  34  40  41  42  43  44  45  46  47  48 ...] = A011534
   [ 5  15  25  35  45  50  51  52  53  54  55  56  57 ...] = A011535
   [ 6  16  26  36  46  56  60  61  62  63  64  65  66 ...] = A011536
   [ 7  17  27  37  47  57  67  70  71  72  73  74  75 ...] = A011537
   [ 8  18  28  38  48  58  68  78  80  81  82  83  84 ...] = A011538
   [ 9  19  29  39  49  59  69  79  89  90  91  92  93 ...] = A011539
   [10 100 101 102 103 104 105 106 107 108 109 110 210 ...] = A293870
   [11 110 111 112 113 114 115 116 117 118 119 211 311 ...] = A293871
   [12 112 120 121 122 123 124 125 126 127 128 129 212 ...] = A293872
   [   ...             ...             ...             ...]

Rémy Sigrist, Table of n, a(n) for n = 1..5050
Rémy Sigrist, Perl program for A293869

Cf. A072484, A292690 (variant starting with row 0).
Cf. A011540, A011531, A011532, A011533, A011534, A011535, A011536, A011537, A011538, A011539, A293870, A293871, A293872.
Cf. A121041, A121022, A121023, A121024, A121025, A121026, A121027, A121028, A121029, A121030, A121031, A121032, A121033, A121034, A121035, A121036, A121037, A121038, A121039, A121040.
Cf. A179239, A261370.
Cf. A292451, A292731 (both partially coincide with row 11, but no inclusion relation holds).

Block[{d = 15, q, a, s}, a = Table[q = n-1; s = IntegerString[n]; Table[While[StringFreeQ[IntegerString[++q], s]]; q, d-n+1], {n, d}]; Table[a[[n, k-n+1]], {k, d}, {n, k}]] (* Paolo Xausa, Mar 01 2024 *)

has=(n,p,m=10^#Str(p))->until(p>n\=10,n%m==p&&return(1))
Mat(vectorv(12,n,a=[];for(k=n,oo,has(k,n)||next;a=concat(a,k);#a>12&&break);a))

Perl
```
See Links section.
```

T(n, k) = A072484(n, k) for any n > 0 and k = 1..n. - Rémy Sigrist, Jan 29 2021

A292690 Square array whose n-th row lists all numbers having n as a substring, read by falling antidiagonals, n >= 0.

Original entry on oeis.org

0, 10, 1, 20, 10, 2, 30, 11, 12, 3, 40, 12, 20, 13, 4, 50, 13, 21, 23, 14, 5, 60, 14, 22, 30, 24, 15, 6, 70, 15, 23, 31, 34, 25, 16, 7, 80, 16, 24, 32, 40, 35, 26, 17, 8, 90, 17, 25, 33, 41, 45, 36, 27, 18, 9, 100, 18, 26, 34, 42, 50, 46, 37, 28, 19, 10

Offset: 0

M. F. Hasler, Oct 18 2017

This array starts with row 0, see A293869 for the variant which starts with row 1.

			The array starts:
   [ 0  10  20  30  40  50  60  70  80  90 100 101 102 ...] = A011540
   [ 1  10  11  12  13  14  15  16  17  18  19  21  31 ...] = A011531
   [ 2  12  20  21  22  23  24  25  26  27  28  29  32 ...] = A011532
   [ 3  13  23  30  31  32  33  34  35  36  37  38  39 ...] = A011533
   [ 4  14  24  34  40  41  42  43  44  45  46  47  48 ...] = A011534
   [ 5  15  25  35  45  50  51  52  53  54  55  56  57 ...] = A011535
   [ 6  16  26  36  46  56  60  61  62  63  64  65  66 ...] = A011536
   [ 7  17  27  37  47  57  67  70  71  72  73  74  75 ...] = A011537
   [ 8  18  28  38  48  58  68  78  80  81  82  83  84 ...] = A011538
   [ 9  19  29  39  49  59  69  79  89  90  91  92  93 ...] = A011539
   [10 100 101 102 103 104 105 106 107 108 109 110 210 ...] = A293870
   [11 110 111 112 113 114 115 116 117 118 119 211 311 ...] = A293871
   [12 112 120 121 122 123 124 125 126 127 128 129 212 ...] = A293872
   [   ...             ...             ...             ...]

Paolo Xausa, Table of n, a(n) for n = 0..11324 (first 150 antidiagonals).

Cf. A293869.
Cf. A011540, A011531, A011532, A011533, A011534, A011535, A011536, A011537, A011538, A011539: rows 0 - 9.
Cf.  A293870, A293871, A293872, A293873, A293874, A293875, A293876, A293877, A293878, A293879, A293880: rows 10 .. 20.
Cf. A121041, A121022, A121023, A121024, A121025, A121026, A121027, A121028, A121029, A121030, A121031, A121032, A121033, A121034, A121035, A121036, A121037, A121038, A121039, A121040: subsequences of the above, only multiples of the pattern p.

Block[{d = 15, q, a, s}, a = Table[q = n-1; s = IntegerString[n]; Table[While[StringFreeQ[IntegerString[++q], s]]; q, d-n], {n, 0, d-1}]; Table[a[[n+1, k-n]], {k, d}, {n, 0, k-1}]] (* Paolo Xausa, Mar 01 2024 *)

has(n,p,m=10^#Str(p))=until(p+!p>n\=10,n%m==p&&return(1))
Mat(vectorv(12,n,a=[];for(k=n--,oo,has(k,n)||next;a=concat(a,k);#a>12&&break);a))
for(i=1,11,for(j=1,i,print1(%[j,i-j+1]","))) \\ Read by antidiagonals

A293871 Numbers having 11 as substring of their digits.

Original entry on oeis.org

11, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 211, 311, 411, 511, 611, 711, 811, 911, 1011, 1100, 1101, 1102, 1103, 1104, 1105, 1106, 1107, 1108, 1109, 1110, 1111, 1112, 1113, 1114, 1115, 1116, 1117, 1118, 1119, 1120, 1121, 1122, 1123, 1124, 1125, 1126, 1127, 1128, 1129, 1130, 1131

Offset: 1

M. F. Hasler, Oct 18 2017

Paolo Xausa, Table of n, a(n) for n = 1..10000
Index entries for 10-automatic sequences

Row 11 of A292690 and A293869.
Cf. A292451, A292731 (both partially coincide with this sequence, but no inclusion relation holds).
Cf. A011540, A011531, A011532, A011533, A011534, A011535, A011536, A011537, A011538, A011539: analog for substrings '0' through '9'.
Cf. A293870, A293872, A293873, A293874, A293875, A293876, A293877, A293878, A293879, A293880: same for substrings '10' - '20'.
Cf. A121031: subsequence of terms divisible by 11.
Numbers divisible by k and having k as a substring: A121022 (2), A121023 (3), A121024 (4), A121025 (5), A121026 (6), A121027 (7), A121028 (8), A121029 (9), A121030 (10), A121031 (11), A121032 (12), A121033 (13), A121034 (14), A121035 (15), A121036 (16), A121037 (17), A121038 (18), A121039 (19), A121040 (20).
Cf. A121041.

Select[Range[2000], StringContainsQ[IntegerString[#], "11"] &] (* Paolo Xausa, Feb 25 2024 *)

is_A293871 = has(n,p=11,m=10^#Str(p))=until(p>n\=10,n%m==p&&return(1))

a(n) ~ n. - Charles R Greathouse IV, Nov 02 2022

A293872 Numbers having '12' as a substring of their digits.

Original entry on oeis.org

12, 112, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 212, 312, 412, 512, 612, 712, 812, 912, 1012, 1112, 1120, 1121, 1122, 1123, 1124, 1125, 1126, 1127, 1128, 1129, 1200, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1212, 1213, 1214, 1215, 1216, 1217, 1218

Offset: 1

M. F. Hasler, Oct 18 2017

Row 12 of A292690 and A293869. A121032 is the subsequence of multiples of 12.

Robert Israel, Table of n, a(n) for n = 1..10000
Index entries for 10-automatic sequences

Cf. A292690, A293869.
Cf. A011540, A011531, A011532, A011533, A011534, A011535, A011536, A011537, A011538, A011539: analog for '0' - '9'.
Cf. A293870, A293871, A293873, A293874, A293875, A293876, A293877, A293878, A293879, A293880: same for '10' - '20'.
Cf. A121041, A121022, A121023, A121024, A121025, A121026, A121027, A121028, A121029, A121030, A121031, A121032, A121033, A121034, A121035, A121036, A121037, A121038, A121039, A121040: subsequences of the above, containing only multiples of the pattern p.

f:= proc(d) local i,x,y;
  sort(convert({seq(seq(seq(x+10^i*12+10^(i+2)*y, y=10^(d-3-i)..10^(d-2-i)-1),x=0..10^i-1),i=0..d-3),
seq(12*10^(d-2)+x,x=0..10^(d-2)-1)},list))
end proc:
seq(op(f(d)),d=2..4); # Robert Israel, Nov 20 2017

Select[Range@ 1220, SequenceCount[IntegerDigits[#], {1, 2}] > 0 &] (* Michael De Vlieger, Nov 20 2017 *)

is_A293872 = has(n, p=12, m=10^#Str(p))=until(p>n\=10, n%m==p&&return(1))

a(n) ~ n. - Charles R Greathouse IV, Nov 02 2022

cp's OEIS Frontend

A121023 Multiples of 3 containing a 3 in their decimal representation.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

Extensions

A011532 Numbers that contain a 2.

Views

Author

Keywords

Links

Crossrefs

Programs

GAP

Haskell

Magma

Mathematica

Formula

A011534 Numbers that contain a 4.

Views

Author

Keywords

Links

Crossrefs

Programs

GAP

Mathematica

PARI

Formula

A016189 a(n) = 10^n - 9^n.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Magma

Mathematica

PARI

Formula

A052405 Numbers without 3 as a digit.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

Python

sh

Formula

Extensions

A256786 Numbers which are divisible by prime(d) for all digits d in their decimal representation.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Mathematica