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

A053432 Numbers with digits in alphabetical order (in English).

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 16, 17, 20, 22, 30, 32, 33, 40, 41, 42, 43, 44, 46, 47, 49, 50, 51, 52, 53, 54, 55, 56, 57, 59, 60, 62, 63, 66, 70, 72, 73, 76, 77, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 96, 97, 99, 100
Offset: 1

Views

Author

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

Keywords

Comments

a(142447) = A053433(1023) = 8549176320 is the greatest term not containing any repeating digits. - Reinhard Zumkeller, Oct 05 2014

Links

Crossrefs

Cf. A247750 (Czech), A247751 (Danish), A247752 (Dutch), 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)
a053432 n = a053432_list !! (n-1)
a053432_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, 5, 4, 9, 1, 7, 6, 3, 2, 0]
-- Reinhard Zumkeller, Oct 05 2014.
  • Python
    from itertools import count, islice, combinations_with_replacement as cwr
def agen(): # generator of terms
    for d in count(1):
        out = sorted(int("".join(t)) for t in cwr("8549176320", d))
        yield from out[1-int(d==1):] # remove extra 0's
print(list(islice(agen(), 65))) # Michael S. Branicky, Aug 17 2022

A247802 Numbers in decimal representation with distinct digits, 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, 12, 13, 14, 15, 16, 17, 19, 24, 25, 26, 27, 30, 32, 34, 35, 36, 37, 39, 45, 46, 47, 56, 57, 67, 80, 81, 82, 83, 84, 85, 86, 87, 89, 90, 92, 94, 95, 96, 97, 102, 104, 105, 106, 107, 124, 125, 126, 127, 130, 132, 134, 135, 136
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;
finite sequence with last and largest term a(992) = 8139024567.

Links

Crossrefs

Intersection of A010784 and A247752.
Cf. A247800 (Czech), A247801 (Danish), A053433 (English), 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)
a247802 n = a247802_list !! (n-1)
a247802_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, 1, 3, 9, 0, 2, 4, 5, 6, 7]

A247800 Numbers in decimal representation with distinct digits, 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, 13, 15, 16, 17, 18, 20, 21, 23, 25, 26, 27, 28, 40, 41, 42, 43, 45, 46, 47, 48, 49, 53, 56, 57, 63, 73, 76, 83, 85, 86, 87, 90, 91, 92, 93, 95, 96, 97, 98, 103, 105, 106, 107, 108, 153, 156, 157, 163, 173, 176, 183, 185, 186
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;
finite sequence with last and largest term a(992) = 4921085673.

Links

Crossrefs

Intersection of A010784 and A247750.
Cf. A247801 (Danish), A247802 (Dutch), A053433 (English), 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)
a247800 n = a247800_list !! (n-1)
a247800_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 = [4, 9, 2, 1, 0, 8, 5, 7, 6, 3]

A247801 Numbers in decimal representation with distinct digits, 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, 12, 13, 14, 15, 16, 17, 18, 19, 23, 40, 42, 43, 46, 47, 48, 49, 50, 52, 53, 54, 56, 57, 58, 59, 62, 63, 67, 72, 73, 82, 83, 86, 87, 90, 92, 93, 96, 97, 98, 102, 103, 106, 107, 108, 123, 140, 142, 143, 146, 147, 148, 149, 150
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;
finite sequence with last and largest term a(992) = 1549086723.

Links

Crossrefs

Intersection of A010784 and Cf. A247751.
Cf. A247800 (Czech), A247802 (Dutch), A053433 (English), 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)
a247801 n = a247801_list !! (n-1)
a247801_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 = [1, 5, 4, 9, 0, 8, 6, 7, 2, 3]

A247803 Numbers in decimal representation with distinct digits, 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, 20, 21, 23, 24, 25, 26, 27, 29, 30, 31, 34, 35, 36, 37, 39, 40, 41, 45, 47, 49, 51, 59, 60, 61, 64, 65, 67, 69, 71, 75, 79, 80, 81, 82, 83, 84, 85, 86, 87, 89, 91, 201, 205, 207, 209, 230, 231, 234, 235, 236, 237, 239, 240, 241
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 05 2014

Keywords

Comments

List of decimal digits, alphabetically sorted by their names in Finnish:
8 kahdeksan, 2 kaksi, 3 kolme, 6 kuusi, 4 neljä, 0 nolla, 7 seitsemän, 5 viisi, 9 yhdeksän, 1 yksi;
finite sequence with last and largest term a(1008) = 8236407591.

Links

Crossrefs

Intersection of A010784 and A247753.
Cf. A247800 (Czech), A247801 (Danish), A247802 (Dutch), A053433 (English), 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)
a247803 n = a247803_list !! (n-1)
a247803_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, 2, 3, 6, 4, 0, 7, 5, 9, 1]

A247804 Numbers in decimal representation with distinct digits, 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, 20, 21, 23, 24, 26, 27, 28, 29, 30, 31, 40, 41, 43, 46, 47, 50, 51, 52, 53, 54, 56, 57, 58, 59, 60, 61, 63, 70, 71, 73, 76, 80, 81, 83, 84, 86, 87, 89, 90, 91, 93, 94, 96, 97, 210, 230, 231, 240, 241, 243, 246, 247, 260, 261
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;
finite sequence with last and largest term a(1023) = 5289476310.

Links

Crossrefs

Intersection of A010784 and A247754.
Cf. A247800 (Czech), A247801 (Danish), A247802 (Dutch), A053433 (English), A247803 (Finnish), 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)
a247804 n = a247804_list !! (n-1)
a247804_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 = [5, 2, 8, 9, 4, 7, 6, 3, 1, 0]

A247805 Numbers in decimal representation with distinct digits, 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, 12, 14, 15, 16, 17, 19, 30, 31, 32, 34, 35, 36, 37, 39, 42, 50, 52, 54, 56, 57, 59, 62, 64, 67, 72, 74, 80, 81, 82, 83, 84, 85, 86, 87, 89, 90, 92, 94, 96, 97, 102, 104, 106, 107, 142, 150, 152, 154, 156, 157, 159, 162, 164
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;
finite sequence with last and largest term a(1008) = 8315906742.

Links

Crossrefs

Intersection of A010784 and A247755.
Cf. A247800 (Czech), A247801 (Danish), A247802 (Dutch), A053433 (English), A247803 (Finnish), A247804 (French), 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)
a247805 n = a247805_list !! (n-1)
a247805_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, 3, 1, 5, 9, 0, 6, 7, 4, 2]

A247806 Numbers in decimal representation with distinct digits, 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, 12, 13, 14, 15, 16, 17, 18, 19, 20, 24, 25, 28, 29, 30, 32, 34, 35, 36, 37, 38, 39, 40, 45, 48, 60, 62, 64, 65, 67, 68, 69, 70, 72, 74, 75, 78, 79, 85, 90, 94, 95, 98, 105, 108, 120, 124, 125, 128, 129, 130, 132, 134, 135
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;
finite sequence with last and largest term a(1020) = 1367294085.

Links

Crossrefs

Intersection of A010784 and A247756.
Cf. A247800 (Czech), A247801 (Danish), A247802 (Dutch), A053433 (English), A247803 (Finnish), A247804 (French), A247805 (German), 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)
a247806 n = a247806_list !! (n-1)
a247806_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 = [1, 3, 6, 7, 2, 9, 4, 0, 8, 5]

A247807 Numbers in decimal representation with distinct digits, such that in Italian and Portuguese their digits are in alphabetic order.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 20, 21, 23, 24, 26, 27, 28, 29, 30, 31, 40, 41, 43, 46, 47, 50, 51, 52, 53, 54, 56, 57, 58, 59, 60, 61, 63, 67, 70, 71, 73, 80, 81, 83, 84, 86, 87, 90, 91, 93, 94, 96, 97, 98, 210, 230, 231, 240, 241, 243, 246, 247, 260, 261
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 05 2014

Keywords

Comments

List of decimal digits, alphabetically sorted by their names in Italian resp. Portuguese: 5 cinque cinco, 2 due dois/duas, 9 nove nove, 8 otto oito, 4 quattro quatro, 6 sei seis, 7 sette sete, 3 tre tres, 1 uno um, 0 zero zero;
finite sequence with last and largest term a(1023) = 5298467310.

Links

Crossrefs

Intersection of A010784 and A247757.
Cf. A247800 (Czech), A247801 (Danish), A247802 (Dutch), A053433 (English), A247803 (Finnish), A247804 (French), A247805 (German), A247806 (Hungarian), A247808 (Latin), A247809 (Norwegian), A247810 (Polish), 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)
a247807 n = a247807_list !! (n-1)
a247807_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 = [5, 2, 9, 8, 4, 6, 7, 3, 1, 0]

A247808 Numbers in decimal representation with distinct digits, 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, 20, 21, 23, 24, 25, 26, 27, 28, 29, 30, 31, 40, 41, 43, 45, 46, 47, 50, 51, 53, 56, 57, 60, 61, 63, 67, 70, 71, 73, 80, 81, 83, 84, 85, 86, 87, 90, 91, 93, 94, 95, 96, 97, 98, 210, 230, 231, 240, 241, 243, 245, 246, 247, 250
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;
finite sequence with last and largest term a(1023) = 2984567310.

Links

Crossrefs

Intersection of A010784 and A247758.
Cf. A247800 (Czech), A247801 (Danish), A247802 (Dutch), A053433 (English), A247803 (Finnish), A247804 (French), A247805 (German), A247806 (Hungarian), A247807 (Italian), 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)
a247808 n = a247808_list !! (n-1)
a247808_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 = [2, 9, 8, 4, 5, 6, 7, 3, 1, 0]
Showing 1-10 of 18 results. Next

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

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