login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A225805 Sort the digits of n into alphabetical order according their French name: The "French Obsessive Filer's Sequence". 2
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 21, 31, 41, 51, 61, 71, 81, 91, 20, 21, 22, 23, 24, 52, 26, 27, 28, 29, 30, 31, 23, 33, 43, 53, 63, 73, 83, 93, 40, 41, 24, 43, 44, 54, 46, 47, 84, 94, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 26, 63, 46, 56 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

French version of A057846, see there for references.

Digits are sorted in the order: 5="cinq", 2="deux", 8="huit", 9="neuf", 4="quatre", 7="sept", 6="six", 3="trois", 1="un", 0="zéro".

Works well for the French language (as for English), because 0="zero" is sorted last. The exact German analog cannot be stored on OEIS, since 0="null" comes before, e.g., 2="zwei": This would yield "02" for 20, but leading zeros are not allowed for terms on OEIS.

LINKS

Table of n, a(n) for n=0..65.

PROG

(PARI) (n, o=[9, 8, 1, 7, 4, 0, 6, 5, 2, 3])->{ sum(i=1, #n=vecsort(digits(n), (a, b)->o[b+1]-o[a+1]), n[i]*10^i)/10}

CROSSREFS

Cf. A057846, A072809.

Sequence in context: A064222 A261294 A321474 * A068637 A004186 A034704

Adjacent sequences:  A225802 A225803 A225804 * A225806 A225807 A225808

KEYWORD

nonn,word,base

AUTHOR

M. F. Hasler, Jul 28 2013

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 21 01:18 EDT 2019. Contains 321356 sequences. (Running on oeis4.)