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-10 of 18 results. Next

A247751 Numbers in decimal representation, such that in Danish their digits are in alphabetic order.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 22, 23, 33, 40, 42, 43, 44, 46, 47, 48, 49, 50, 52, 53, 54, 55, 56, 57, 58, 59, 62, 63, 66, 67, 72, 73, 77, 82, 83, 86, 87, 88, 90, 92, 93, 96, 97, 98, 99, 100, 102, 103, 106, 107, 108
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 05 2014

Keywords

Comments

List of decimal digits, alphabetically sorted by their names in Danish:
1 en/et, 5 fem, 4 fire, 9 ni, 0 nul, 8 otte, 6 seks, 7 syv, 2 to, 3 tre;
a(124929) = A247801(992) = 1549086723 is the greatest term not containing any repeating digits.

Crossrefs

Cf. A247801 (subsequence).
Cf. A247750 (Czech), A247752 (Dutch), A053432 (English), A247753 (Finnish), A247754 (French), A247755 (German), A247756 (Hungarian), A247757 (Italian), A247758 (Latin), A247759 (Norwegian), A247760 (Polish), A247757 (Portuguese), A247761 (Russian), A247762 (Slovak), A161390 (Spanish), A247759 (Swedish), A247764 (Turkish).

Programs

  • Haskell
    import Data.IntSet (fromList, deleteFindMin, union)
    a247751 n = a247751_list !! (n-1)
    a247751_list = 0 : f (fromList [1..9]) where
       f s = x : f (s' `union`
             fromList (map (+ 10 * x) $ dropWhile (/= mod x 10) digs))
         where (x, s') = deleteFindMin s
       digs = [1, 5, 4, 9, 0, 8, 6, 7, 2, 3]

A053433 Numbers with distinct digits in alphabetical order (in English).

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 16, 17, 20, 30, 32, 40, 41, 42, 43, 46, 47, 49, 50, 51, 52, 53, 54, 56, 57, 59, 60, 62, 63, 70, 72, 73, 76, 80, 81, 82, 83, 84, 85, 86, 87, 89, 90, 91, 92, 93, 96, 97, 120, 130, 132, 160, 162, 163, 170, 172, 173, 176
Offset: 1

Views

Author

G. L. Honaker, Jr., Jan 10 2000

Keywords

Comments

Largest term is 8549176320.

Crossrefs

Subsequence of A053432.
Cf. A247800 (Czech), A247801 (Danish), A247802 (Dutch), A247803 (Finnish), A247804 (French), A247805 (German), A247806 (Hungarian), A247807 (Italian), A247808 (Latin), A247809 (Norwegian), A247810 (Polish), A247807 (Portuguese), A247811 (Russian), A247812 (Slovak), A247813 (Spanish), A247809 (Swedish), A247814 (Turkish).

Programs

  • Haskell
    import Data.IntSet (fromList, deleteFindMin, union)
    import qualified Data.IntSet as Set (null)
    a053433 n = a053433_list !! (n-1)
    a053433_list = 0 : f (fromList [1..9]) where
       f s | Set.null s = []
           | otherwise  = x : f (s' `union`
             fromList (map (+ 10 * x) $ tail $ dropWhile (/= mod x 10) digs))
           where (x, s') = deleteFindMin s
       digs = [8, 5, 4, 9, 1, 7, 6, 3, 2, 0]
    -- Reinhard Zumkeller, Oct 05 2014
    
  • Python
    from itertools import combinations
    afull = sorted(int("".join(t)) for d in range(1, 11) for t in combinations("8549176320", d))
    print(afull[:65]) # Michael S. Branicky, Aug 17 2022

A161390 Numbers with digits in alphabetical order (in Spanish).

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 21, 22, 23, 26, 27, 28, 29, 31, 33, 41, 42, 43, 44, 46, 47, 48, 49, 51, 52, 53, 54, 55, 56, 57, 58, 59, 61, 63, 66, 67, 71, 73, 77, 81, 83, 86, 87, 88, 91, 93, 96, 97, 98, 99, 111, 211
Offset: 1

Views

Author

Claudio Meller, Jun 08 2009

Keywords

Comments

List of decimal digits, alphabetically sorted by their names in Spanish:
0 cero, 5 cinco, 4 cuatro, 2 dos, 9 nueve, 8 ocho, 6 seis, 7 siete, 3 tres, 1 uno/una. - Reinhard Zumkeller, Oct 05 2014
a(36233) = A247813(512) = 542986731 is the greatest term not containing any repeating digits. - Reinhard Zumkeller, Oct 05 2014

Crossrefs

Cf. A247813 (subsequence).
Cf. A247750 (Czech), A247751 (Danish), A247752 (Dutch), A053432 (English), A247753 (Finnish), A247754 (French), A247755 (German), A247756 (Hungarian), A247757 (Italian), A247758 (Latin), A247759 (Norwegian), A247760 (Polish), A247757 (Portuguese), A247761 (Russian), A247762 (Slovak), A247759 (Swedish), A247764 (Turkish).

Programs

  • Haskell
    import Data.IntSet (fromList, deleteFindMin, union)
    a161390 n = a161390_list !! (n-1)
    a161390_list = 0 : f (fromList [1..9]) where
       f s = x : f (s' `union`
             fromList (map (+ 10 * x) $ dropWhile (/= mod x 10) digs))
         where (x, s') = deleteFindMin s
       digs = [0, 5, 4, 2, 9, 8, 6, 7, 3, 1]
    -- Reinhard Zumkeller, Oct 18 2014
  • Perl
    sub isA161390 {
      shift =~ m/^(0|5*4*2*9*8*6*7*3*1*)$/
    }
    

A247758 Numbers in decimal representation, such that in Latin their digits are in alphabetic order.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 33, 40, 41, 43, 44, 45, 46, 47, 50, 51, 53, 55, 56, 57, 60, 61, 63, 66, 67, 70, 71, 73, 77, 80, 81, 83, 84, 85, 86, 87, 88, 90, 91, 93, 94, 95, 96, 97, 98, 99, 100, 110
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 05 2014

Keywords

Comments

List of decimal digits, alphabetically sorted by their names in Latin:
2 duo/duae/duo, 9 novem, 8 octo, 4 quattuor, 5 quinque, 6 sex, 7 septem, 3 tres/tria, 1 unus/una/unum, 0 zipherum;
a(131861) = A247808(1023) = 2984567310 is the greatest term not containing any repeating digits.

Crossrefs

Cf. A247808 (subsequence).
Cf. A247750 (Czech), A247751 (Danish), A247752 (Dutch), A053432 (English), A247753 (Finnish), A247754 (French), A247755 (German), A247756 (Hungarian), A247757 (Italian), A247759 (Norwegian), A247760 (Polish), A247757 (Portuguese), A247761 (Russian), A247762 (Slovak), A161390 (Spanish), A247759 (Swedish), A247764 (Turkish).

Programs

  • Haskell
    import Data.IntSet (fromList, deleteFindMin, union)
    a247758 n = a247758_list !! (n-1)
    a247758_list = 0 : f (fromList [1..9]) where
       f s = x : f (s' `union`
             fromList (map (+ 10 * x) $ dropWhile (/= mod x 10) digs))
         where (x, s') = deleteFindMin s
       digs = [2, 9, 8, 4, 5, 6, 7, 3, 1, 0]

A247750 Numbers in decimal representation, such that in Czech their digits are in alphabetic order.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 16, 17, 18, 20, 21, 22, 23, 25, 26, 27, 28, 33, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 53, 55, 56, 57, 63, 66, 73, 76, 77, 83, 85, 86, 87, 88, 90, 91, 92, 93, 95, 96, 97, 98, 99, 100, 103, 105, 106, 107, 108
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 05 2014

Keywords

Comments

List of decimal digits, alphabetically sorted by their names in Czech:
4 čtyři, 9 devět, 2 dva/dvě, 1 jeden/jedna/jedno, 0 nula, 8 osm, 5 pět, 7 sedm, 6 šest, 3 tři;
a(144740) = A247800(992) = 4921085763 is the greatest term not containing any repeating digits.

Crossrefs

Cf. A247800 (subsequence).
Cf. A247751 (Danish), A247752 (Dutch), A053432 (English), A247753 (Finnish), A247754 (French), A247755 (German), A247756 (Hungarian), A247757 (Italian), A247758 (Latin), A247759 (Norwegian), A247760 (Polish), A247757 (Portuguese), A247761 (Russian), A247762 (Slovak), A161390 (Spanish), A247759 (Swedish), A247764 (Turkish).

Programs

  • Haskell
    import Data.IntSet (fromList, deleteFindMin, union)
    a247750 n = a247750_list !! (n-1)
    a247750_list = 0 : f (fromList [1..9]) where
       f s = x : f (s' `union`
             fromList (map (+ 10 * x) $ dropWhile (/= mod x 10) digs))
         where (x, s') = deleteFindMin s
       digs = [4, 9, 2, 1, 0, 8, 5, 7, 6, 3]

A247752 Numbers in decimal representation, such that in Dutch their digits are in alphabetic order.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 19, 22, 24, 25, 26, 27, 30, 32, 33, 34, 35, 36, 37, 39, 44, 45, 46, 47, 55, 56, 57, 66, 67, 77, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 92, 94, 95, 96, 97, 99, 100, 102, 104, 105, 106, 107
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 05 2014

Keywords

Comments

List of decimal digits, alphabetically sorted by their names in Dutch:
8 acht, 1 een, 3 drie, 9 negen, 0 nul, 2 twee, 4 vier, 5 vijf, 6 zes, 7 zeven;
a(137654) = A247802(992) = 8139024567 is the greatest term not containing any repeating digits.

Crossrefs

Cf. A247802 (subsequence).
Cf. A247750 (Czech), A247751 (Danish), A053432 (English), A247753 (Finnish), A247754 (French), A247755 (German), A247756 (Hungarian), A247757 (Italian), A247758 (Latin), A247759 (Norwegian), A247760 (Polish), A247757 (Portuguese), A247761 (Russian), A247762 (Slovak), A161390 (Spanish), A247759 (Swedish), A247764 (Turkish).

Programs

  • Haskell
    import Data.IntSet (fromList, deleteFindMin, union)
    a247752 n = a247752_list !! (n-1)
    a247752_list = 0 : f (fromList [1..9]) where
       f s = x : f (s' `union`
             fromList (map (+ 10 * x) $ dropWhile (/= mod x 10) digs))
         where (x, s') = deleteFindMin s
       digs = [8, 1, 3, 9, 0, 2, 4, 5, 6, 7]

A247753 Numbers in decimal representation, such that in Finnish their digits are in alphabetic order.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 20, 21, 22, 23, 24, 25, 26, 27, 29, 30, 31, 33, 34, 35, 36, 37, 39, 40, 41, 44, 45, 47, 49, 51, 55, 59, 60, 61, 64, 65, 66, 67, 69, 71, 75, 77, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 91, 99, 111, 200, 201, 205, 207, 209
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 05 2014

Keywords

Comments

List of decimal digits, alphabetically sorted by their names in Finnish:
a(143982) = A247803(1008) = 8236407591 is the greatest term not containing any repeating digits.

Crossrefs

Cf. A247803 (subsequence).
Cf. A247750 (Czech), A247751 (Danish), A247752 (Dutch), A053432 (English), A247754 (French), A247755 (German), A247756 (Hungarian), A247757 (Italian), A247758 (Latin), A247759 (Norwegian), A247760 (Polish), A247757 (Portuguese), A247761 (Russian), A247762 (Slovak), A161390 (Spanish), A247759 (Swedish), A247764 (Turkish).

Programs

  • Haskell
    import Data.IntSet (fromList, deleteFindMin, union)
    a247753 n = a247753_list !! (n-1)
    a247753_list = 0 : f (fromList [1..9]) where
       f s = x : f (s' `union`
             fromList (map (+ 10 * x) $ dropWhile (/= mod x 10) digs))
         where (x, s') = deleteFindMin s
       digs = [8, 2, 3, 6, 4, 0, 7, 5, 9, 1]

A247754 Numbers in decimal representation, such that in French their digits are in alphabetic order.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 20, 21, 22, 23, 24, 26, 27, 28, 29, 30, 31, 33, 40, 41, 43, 44, 46, 47, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 63, 66, 70, 71, 73, 76, 77, 80, 81, 83, 84, 86, 87, 88, 89, 90, 91, 93, 94, 96, 97, 99, 100, 110
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 05 2014

Keywords

Comments

List of decimal digits, alphabetically sorted by their names in French:
5 cinq, 2 deux, 8 huit, 9 neuf, 4 quatre, 7 sept, 6 six, 3 trois, 1 un, 0 zéro;
a(129217) = A247804(1023) = 5289476310 is the greatest term not containing any repeating digits.

Crossrefs

Cf. A247804 (subsequence).
Cf. A247750 (Czech), A247751 (Danish), A247752 (Dutch), A053432 (English), A247753 (Finnish), A247755 (German), A247756 (Hungarian), A247757 (Italian), A247758 (Latin), A247759 (Norwegian), A247760 (Polish), A247757 (Portuguese), A247761 (Russian), A247762 (Slovak), A161390 (Spanish), A247759 (Swedish), A247764 (Turkish).

Programs

  • Haskell
    import Data.IntSet (fromList, deleteFindMin, union)
    a247754 n = a247754_list !! (n-1)
    a247754_list = 0 : f (fromList [1..9]) where
       f s = x : f (s' `union`
             fromList (map (+ 10 * x) $ dropWhile (/= mod x 10) digs))
         where (x, s') = deleteFindMin s
       digs = [5, 2, 8, 9, 4, 7, 6, 3, 1, 0]

A247755 Numbers in decimal representation, such that in German their digits are in alphabetic order.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 19, 22, 30, 31, 32, 33, 34, 35, 36, 37, 39, 42, 44, 50, 52, 54, 55, 56, 57, 59, 62, 64, 66, 67, 72, 74, 77, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 92, 94, 96, 97, 99, 100, 102, 104, 106, 107, 110
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 05 2014

Keywords

Comments

List of decimal digits, alphabetically sorted by their names in German:
8 acht, 3 drei, 1 eins, 5 fünf, 9 neun, 0 null, 6 sechs, 7 sieben, 4 vier, 2 zwei;
a(142055) = A247805(1008) = 8315906742 is the greatest term not containing any repeated digits.

Crossrefs

Cf. A247805 (subsequence).
Cf. A247750 (Czech), A247751 (Danish), A247752 (Dutch), A053432 (English), A247753 (Finnish), A247754 (French), A247756 (Hungarian), A247757 (Italian), A247758 (Latin), A247759 (Norwegian), A247760 (Polish), A247757 (Portuguese), A247761 (Russian), A247762 (Slovak), A161390 (Spanish), A247759 (Swedish), A247764 (Turkish).

Programs

  • Haskell
    import Data.IntSet (fromList, deleteFindMin, union)
    a247755 n = a247755_list !! (n-1)
    a247755_list = 0 : f (fromList [1..9]) where
       f s = x : f (s' `union`
             fromList (map (+ 10 * x) $ dropWhile (/= mod x 10) digs))
         where (x, s') = deleteFindMin s
       digs = [8, 3, 1, 5, 9, 0, 6, 7, 4, 2]

A247756 Numbers in decimal representation, such that in Hungarian their digits are in alphabetic order.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 24, 25, 28, 29, 30, 32, 33, 34, 35, 36, 37, 38, 39, 40, 44, 45, 48, 55, 60, 62, 64, 65, 66, 67, 68, 69, 70, 72, 74, 75, 77, 78, 79, 85, 88, 90, 94, 95, 98, 99, 100, 105, 108, 110
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 05 2014

Keywords

Comments

List of decimal digits, alphabetically sorted by their names in Hungarian:
1 egy, 3 három, 6 hat, 7 hét, 2 kettő, 9 kilenc, 4 négy, 0 nulla, 8 nyolc, 5 öt.
a(127748) = A247806(1020) = 1367294085 is the greatest term not containing any repeating digits.

Crossrefs

Cf. A247806 (subsequence).
Cf. A247750 (Czech), A247751 (Danish), A247752 (Dutch), A053432 (English), A247753 (Finnish), A247754 (French), A247755 (German), A247757 (Italian), A247758 (Latin), A247759 (Norwegian), A247760 (Polish), A247757 (Portuguese), A247761 (Russian), A247762 (Slovak), A161390 (Spanish), A247759 (Swedish), A247764 (Turkish).

Programs

  • Haskell
    import Data.IntSet (fromList, deleteFindMin, union)
    a247756 n = a247756_list !! (n-1)
    a247756_list = 0 : f (fromList [1..9]) where
       f s = x : f (s' `union`
             fromList (map (+ 10 * x) $ dropWhile (/= mod x 10) digs))
         where (x, s') = deleteFindMin s
       digs = [1, 3, 6, 7, 2, 9, 4, 0, 8, 5]
Showing 1-10 of 18 results. Next