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.

Showing 1-4 of 4 results.

A038378 Integers which have more distinct digits than any smaller number.

Original entry on oeis.org

0, 10, 102, 1023, 10234, 102345, 1023456, 10234567, 102345678, 1023456789
Offset: 1

Views

Author

N. J. A. Sloane

Keywords

Comments

Or: Smallest number with exactly n distinct digits. - M. F. Hasler, May 04 2017

Links

Crossrefs

Cf. A007809, A043537, A086069.

Programs

  • Mathematica
    Prepend[NestList[FromDigits[Append[IntegerDigits[#],Last[Union[IntegerDigits[#]]]+1]]&,10,8],0] (* Ivan N. Ianakiev, May 10 2015 *)
Join[{0},Table[FromDigits[PadRight[{1,0},n,{1,0,2,3,4,5,6,7,8,9}]],{n,2,10}]] (* Harvey P. Dale, Sep 27 2016 *)
  • PARI
    A038378(n)=sum(i=1,n--,10^(n-i)*if(i>1,i,10)) \\ M. F. Hasler, May 04 2017

Extensions

Offset fixed by Reinhard Zumkeller, Aug 25 2009

A086068 Min{k: A086066(k) = n}.

Original entry on oeis.org

0, 1, 10, 2, 20, 12, 102, 3, 30, 13, 103, 23, 203, 123, 1023, 4, 40, 14, 104, 24, 204, 124, 1024, 34, 304, 134, 1034, 234, 2034, 1234, 10234, 5, 50, 15, 105, 25, 205, 125, 1025, 35, 305, 135, 1035, 235, 2035, 1235, 10235, 45, 405, 145, 1045, 245, 2045
Offset: 1

Views

Author

Reinhard Zumkeller, Jul 08 2003

Keywords

Comments

Sequence is finite with last term a(2^10-1)=a(1023)=1023456789; A086067(1023456789)=1111111111.

Links

Crossrefs

Cf. A086069, A086070, A086067.

Programs

  • Maple
    A086068 := proc(n) local b,k,s: s:={}: if(n=1)then return 0: fi: b:=convert(n,base,2): for k from 1 to nops(b) do if(b[k] = 1)then s:=s union {k-1}: fi: od: s:=sort(convert(s,list)): if(s[1]=0)then return s[2]*10^(nops(s)-1)+add(s[j]*10^(nops(s)-j),j=3..nops(s)): else return add(s[j]*10^(nops(s)-j),j=1..nops(s)): fi: end: seq(A086068(n),n=1..53); # Nathaniel Johnston, Jun 01 2011

A086070 Where records in A086068 occur.

Original entry on oeis.org

1, 2, 3, 5, 7, 11, 13, 15, 23, 27, 29, 31, 47, 55, 59, 61, 63, 95, 111, 119, 123, 125, 127, 191, 223, 239, 247, 251, 253, 255, 383, 447, 479, 495, 503, 507, 509, 511, 767, 895, 959, 991, 1007, 1015, 1019, 1021, 1023
Offset: 1

Views

Author

Reinhard Zumkeller, Jul 08 2003

Keywords

Comments

A086069(n)=A086068(a(n)) and A086068(i) < A086069(n) for i
a(n) = A086066(A086069(n)).

Crossrefs

Cf. A086084.

A086084 A086070 in binary.

Original entry on oeis.org

1, 10, 11, 101, 111, 1011, 1101, 1111, 10111, 11011, 11101, 11111, 101111, 110111, 111011, 111101, 111111, 1011111, 1101111, 1110111, 1111011, 1111101, 1111111, 10111111, 11011111, 11101111, 11110111, 11111011, 11111101
Offset: 1

Views

Author

Reinhard Zumkeller, Jul 08 2003

Keywords

Comments

a(n) = A007088(A086070(n)).

Links

Crossrefs

Cf. A086067, A086068, A086069.
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

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