cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

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

Views

Author

Jonathan Vos Post, Apr 09 2012

Keywords

Comments

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

Crossrefs

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).

Programs

  • Mathematica
    t = Select[Range[100000, 999999], Sort[Transpose[Tally[IntegerDigits[#]]][[2]]] == {1, 2, 3} &]; Take[t, 32] (* T. D. Noe, Apr 11 2012 *)
  • PARI
    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