A247809 Numbers in decimal representation with distinct digits, such that in Norwegian and Swedish their digits are in alphabetic order.

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 19, 23, 40, 42, 43, 46, 47, 49, 50, 52, 53, 54, 56, 57, 59, 62, 63, 67, 69, 72, 73, 79, 80, 81, 82, 83, 84, 85, 86, 87, 89, 92, 93, 102, 103, 106, 107, 109, 123, 140, 142, 143, 146, 147, 149, 150, 152

Offset: 1

Author

Reinhard Zumkeller, Oct 05 2014

Keywords

• nonn
• base
• word
• fini
• full

Comments

List of decimal digits, alphabetically sorted by their names in Norwegian resp. Swedish: 8 åtte åtta, 1 en/ett en/ett, 5 fem fem, 4 fire fyra, 0 null noll, 6 seks sex, 7 syv/sju sju, 9 ti tio, 2 to två, 3 tre tre;

Finite sequence with last and largest term a(992) = 8154067923.

From Charles Coker, Jul 18 2019: (Start)

The word tio (10) should probably be nio (9). Sources: 1) Wikipedia, List of numbers in various languages: Germanic languages, 2) Swedish Language Blog, Swedish numbers 1-100.

The names are sorted using English sorting rules. In Swedish, the letter Å/å, like in åtta (8), comes after z. Alphabetical order is a, ..., z, å, ä, ö. Using Swedish sorting rules and nio for 9, the sequence for 0-9 would be 1, 5, 4, 9, 0, 6, 7, 3, 2, 8. Sources: 1) Swedish speaker (not me), 2) Wikipedia: Swedish alphabet.

(End)

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..992
• Swedish Language Blog, Swedish numbers 1-100
• Wikipedia, Zahlen in unterschiedlichen Sprachen
• Wikipedia, List of numbers in various languages
• Wikipedia, List of numbers in various languages: Germanic languages
• Wikipedia, Swedish alphabet

Crossrefs

Intersection of A010784 and A247759.

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

Programs

Haskell

import Data.IntSet (fromList, deleteFindMin, union)
import qualified Data.IntSet as Set (null)
a247809 n = a247809_list !! (n-1)
a247809_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, 5, 4, 0, 6, 7, 9, 2, 3]