A218566 -id:A218566 - cp's OEIS frontend

A182040 Integers whose decimal representation consists of three distinct digits, one appearing once, one appearing twice, and one appearing three times.

100012, 100013, 100014, 100015, 100016, 100017, 100018, 100019, 100021, 100022, 100031, 100033, 100041, 100044, 100051, 100055, 100061, 100066, 100071, 100077, 100081, 100088, 100091, 100099, 100102, 100103, 100104, 100105, 100106, 100107, 100108, 100109, 100112

Offset: 1

Jonathan Vos Post, Apr 09 2012

There are 38880 terms, including 41 squares (A182098) and 3640 primes (A182092). - Zak Seidov, Apr 12 2012

This is the subsequence of A218556 consisting of terms with indices n = 254, ..., 39133. The number of terms is 38880 = A218566(10,3), the starting index is 254 = 1 + A218566(10,1) + A218566(10,2) + 1. - M. F. Hasler, Nov 02 2012

Charles R Greathouse IV, Table of n, a(n) for n = 1..38880 (complete sequence)

Cf. A071925, A181986 (digitally balanced numbers: ternary numbers which have the same number of 0's as 1's as 2's), A182051 (primes with a majority of one digit).

t = Select[Range[100000, 999999], Sort[Transpose[Tally[IntegerDigits[#]]][[2]]] == {1, 2, 3} &]; Take[t, 32] (* T. D. Noe, Apr 11 2012 *)

is(n)=n=vecsort(eval(Vec(Str(n))));vecsort(apply(k->sum(i=1, #n,n[i]==k),vecsort(n,,8)))==[1,2,3] \\ Charles R Greathouse IV, Apr 11 2012

A218556 Numbers with d distinct decimal digits (d=1,...,10) such that for each k=1,...,d, some digit occurs exactly k times.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 100, 101, 110, 112, 113, 114, 115, 116, 117, 118, 119, 121, 122, 131, 133, 141, 144, 151, 155, 161, 166, 171, 177, 181, 188, 191, 199, 200, 202, 211, 212, 220, 221, 223, 224, 225, 226, 227, 228, 229, 232, 233, 242, 244, 252, 255, 262, 266, 272, 277, 282, 288, 292, 299, 300, 303, 311, 313, 322, 323, 330

Offset: 1

M. F. Hasler, Nov 02 2012

For each of the terms, the number of digits is a triangular number A000217.
The number of terms with d = 1,2,3,... different digits is 10, 243, 38880, ... = A218566(10,d) (+ 1 for d=1, accounting for the initial 0).
The sequence is finite, it has N = 1 + sum_{i=1..10} A218566(10,i) = 9083370609101493843078695864582213215764827510991133 terms. The last term is a(N) = 9999999999888888888777777776666666555555444443333222110 (ten "9"s, nine "8"s, ..., one "0").

			The terms a(1)=0 through a(10)=9 have exactly 1 digit occurring exactly once.
The terms a(11)=100 through a(253)=998, listed in A210666, have one digit occurring once and a second, different digit occurring exactly twice.
The terms a(254)=100012 through a(39133)=999887 are listed in A182040.
For d=4, we have the (1+2+3+4 =) 10-digit terms a(39134)=1000011223 through 9999888776 with 4 different digits which occur with frequencies 1,2,3 and 4.

Cf. A071925, A181986, A182040, A182092.

{my(T(n)=n*(n+1)\2); print1(0); for(i=1,2, s=vector(i+1,j,j-1); for(n=10^(T(i)-1),10^T(i)-1,i !=#Set(digits(n)) & next; c=vector(10); for(j=1,#d=digits(n),c[d[j]+1]++); vecsort(c,,8)==s & print1(","n)))}

is_A218556(n)={ my(c=vector(10)); for(i=1,#n=digits(n),c[n[i]+1]++); #(c=vecsort(c,,8))==1+c[#c] && 2*#n==c[#c]*#c }

A218560 Numbers with d distinct ternary digits (d=1,2,3) such that for each k=1,...,d, some digit occurs exactly k times.

Original entry on oeis.org

0, 1, 2, 9, 10, 12, 14, 16, 17, 18, 20, 22, 23, 24, 25, 248, 250, 251, 254, 257, 258, 259, 262, 263, 264, 265, 267, 269, 272, 275, 276, 277, 281, 285, 287, 288, 289, 291, 293, 295, 296, 298, 299, 300, 301, 303, 305, 306, 307, 309, 311, 313, 314, 315, 317, 319, 320, 321, 322, 326, 329, 330, 331, 335

Offset: 1

M. F. Hasler, Nov 02 2012

For each of the terms, the number of ternary (= base 3) digits is a triangular number A000217.
The base 2 analog would have only the 5 terms 0,1,4,5,6. See A218556 for the base 10 analog.
The sequence A167819 is a subsequence containing exactly all terms >= 9.
The sequence is finite, with 255=3+12+240 (= 1 + sum of the 3rd row of A218566) terms.

			The terms a(1)=0 through a(3)=2 have exactly 1 digit occurring exactly once.
The terms a(4)=9=100[3] through a(15)=25=221[3], have one ternary digit occurring once and a second, different digit occurring exactly twice.
The terms a(16)=248=100012[3] through a(255)=714=222110[3] contain each ternary digit at least once. There are no other terms in this sequence.

M. F. Hasler, Table of n, a(n) for n = 1..255 (full sequence).

Cf. A218559, A182040, A218556.

{my(T(n)=n*(n+1)\2); print1(0); for(i=1,3, s=vector(i+1,j,j-1); for(n=3^(T(i)-1),3^T(i)-1,i !=#Set(digits(n,3)) & next; c=vector(4); for(j=1,#d=digits(n,3),c[d[j]+1]++); vecsort(c,,8)==s & print1(","n)))}

is_A218560(n,b=3)={ my(c=vector(b+1)); for(i=1,#n=digits(n,b),c[n[i]+1]++); #(c=vecsort(c,,8))==1+c[#c] && 2*#n==c[#c]*#c }

cp's OEIS Frontend

A182040 Integers whose decimal representation consists of three distinct digits, one appearing once, one appearing twice, and one appearing three times.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

A218556 Numbers with d distinct decimal digits (d=1,...,10) such that for each k=1,...,d, some digit occurs exactly k times.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI

PARI

A218560 Numbers with d distinct ternary digits (d=1,2,3) such that for each k=1,...,d, some digit occurs exactly k times.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

PARI