A007208 -id:A007208 - cp's OEIS frontend

A005589 Number of letters in the US English name of n, excluding spaces and hyphens.

4, 3, 3, 5, 4, 4, 3, 5, 5, 4, 3, 6, 6, 8, 8, 7, 7, 9, 8, 8, 6, 9, 9, 11, 10, 10, 9, 11, 11, 10, 6, 9, 9, 11, 10, 10, 9, 11, 11, 10, 5, 8, 8, 10, 9, 9, 8, 10, 10, 9, 5, 8, 8, 10, 9, 9, 8, 10, 10, 9, 5, 8, 8, 10, 9, 9, 8, 10, 10, 9, 7, 10, 10, 12, 11, 11, 10, 12, 12, 11, 6, 9, 9, 11, 10, 10, 9, 11, 11, 10, 6, 9, 9, 11, 10, 10, 9, 11, 11, 10, 10, 13, 13, 15, 14, 14, 13, 15, 15, 14, 13, 16, 16, 18, 18, 17, 17, 19, 18, 18, 16

Offset: 0

N. J. A. Sloane

Diane Karloff observes (Nov 27 2007) that repeatedly applying the map k->A005589(k) to any starting value n always leads to 4 (cf. A016037, A133418).
The above observation was previously made in 1972 by R. Schroeppel and R. W. Gosper in HAKMEM (Item 134). - Bartlomiej Pawlik, Jun 12 2023
For terms beyond a(100), this sequence uses the US English style, "one hundred one" (not "one hundred and one"), and the short scale (a billion = 10^9, not 10^12). - M. F. Hasler, Nov 03 2013
Explanation of Diane Karloff's observation above: In many languages there exists a number N, after which all numbers are written with fewer letters than the number itself. N is 4 in English, German and Bulgarian, and 11 in Russian. If in the interval [1,N] there are numbers equal to the number of their letters, then they are attractors. In English and German the only attractor is 4, in Bulgarian 3, in Russian there are two, 3 and 11. In the interval [1,N] there may also exist loops of numbers, for instance 4 and 6 in Bulgarian (6 and 4 letters respectively) or 4,5 and 6 in Russian (6,4 and 5 letters respectively). There are no loops in English, therefore the above observation is true. - Ivan N. Ianakiev, Sep 20 2014

			Note that A052360(373373) = 64 whereas a(373373) = 56.

Problems Drive, Eureka, 37 (1974), 8-11 and 33.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Ely Golden, Table of n, a(n) for n = 0..11159
M. Beeler, R. W. Gosper and R. Schroeppel, Item 134, in Beeler, M., Gosper, R. W. and Schroeppel, R. HAKMEM. MIT AI Memo 239, Feb 29 1972.
Eureka, Problems Drive, Eureka, 37 (1974), 8-11, 32-33, 24-27. (Annotated scanned copy)
Ely Golden, Arbitrary precision number naming program in Java
Mathematica Stack Exchange, How to express an integer number in English words?
Landon Curt Noll, The English Name of a Number.
Eric Weisstein's World of Mathematics, Number.
Robert G. Wilson v, English names for the numbers from 0 to 11159 without spaces or hyphens.
Index entries for sequences related to number of letters in n

Cf. A006944 (ordinals), A052360, A052362, A052363, A134629, A133418, A016037.
See A362123 for another version.
Cf. A007208 (analog for German).

inWords[n_] := Module[{r,
numNames = {"", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"},
teenNames = {"ten", "eleven", "twelve", "thirteen", "fourteen", "fifteen", "sixteen", "seventeen", "eighteen", "nineteen"},
tensNames = {"", "ten", "twenty", "thirty", "forty", "fifty", "sixty", "seventy", "eighty", "ninety"},
decimals = {"", "thousand", "million", "billion", "trillion", "quadrillion", "quintillion", "sextillion", "septillion", "octillion", "nonillion", "decillion", "undecillion", "duodecillion", "tredecillion", "quattuordecillion", "quindecillion", "sexdecillion", "septendecillion", "octodecillion", "novemdecillion", "vigintillion", "unvigintillion", "duovigintillion", "trevigintillion", "quattuorvigintillion", "quinvigintillion", "sexvigintillion", "septenvigintillion", "octovigintillion", "novemvigintillion", "trigintillion", "untrigintillion", "duotrigintillion"}},
r = If[# != 0, numNames[[# + 1]] <> "hundred"
(* <> If[#2 != 0||#3 != 0," and",""] *),
""] <> Switch[#2, 0, numNames[[#3 + 1]], 1, teenNames[[#3 + 1]], _, tensNames[[#2 + 1]] <> numNames[[#3 + 1]]] & @@@
(PadLeft[ FromDigits /@ Characters@ StringReverse@#, 3] & /@ StringCases[ StringReverse@ IntegerString@ n, RegularExpression["\\d{1,3}"]]);
StringJoin@ Reverse@ MapThread[ If[# != "", StringJoin[##], ""] &, {r, Take[decimals, Length@ r]} ]]; (* modified for this sequence from what is presented in the link and good to 10^102 -1 *)
f[n_] := StringLength@ inWords@ n; f[0] = 4; Array[f, 84, 0]
(* Robert G. Wilson v, Nov 04 2007 and revised Mar 31 2015, small revision by Ivan Panchenko, Nov 10 2019 *)
a[n_] := StringLength[ StringReplace[ IntegerName[n, "Words"], "," | " " | "\[Hyphen]" -> ""]]; a /@ Range[0, 83] (* Mma version >= 10, Giovanni Resta, Apr 10 2017 *)

A005589(n, t=[10^12, #"trillion", 10^9, #"billion", 10^6, #"million", 1000, #"thousand", 100, #"hundred"])={ n>99 && forstep( i=1, #t, 2, n999 && error("n >= 10^",valuation(t[1],10)+3," requires extended 2nd argument"); return( A005589(n[1])+t[i+1]+if( n[2], A005589( n[2] )))); if( n<20, #(["zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine", "ten", "eleven", "twelve", "thirteen", "fourteen", "fifteen", "sixteen", "seventeen", "eighteen", "nineteen"][n+1]), #([ "twenty", "thirty", "forty", "fifty", "sixty", "seventy", "eighty", "ninety" ][n\10-1])+if( n%10, A005589(n%10)))}  \\ Extension of 2nd arg to larger numbers is easy using the names listed in Mathematica section above. Only the string lengths are required, so it's easy to extend this list further without additional knowledge and without writing out the names. - M. F. Hasler, Jul 26 2011, minor edit on Jun 15 2021

from num2words import num2words
def a(n):
    x = num2words(n).replace(' and ', '')
    l = [chr(i) for i in range(97, 123)]
    return sum(1 for i in x if i in l)
print([a(n) for n in range(101)]) # Indranil Ghosh, Jul 05 2017

Corrected and extended by Larry Reeves (larryr(AT)acm.org) and Allan C. Wechsler, Mar 20 2000
Erroneous b-file deleted by N. J. A. Sloane, Sep 25 2008
More than the usual number of terms are shown in the DATA field to avoid confusion with A362123. - N. J. A. Sloane, Apr 20 2023

A167507 Number of letters in the French spelling of the number n, not counting hyphens and spaces.

Original entry on oeis.org

4, 2, 4, 5, 6, 4, 3, 4, 4, 4, 3, 4, 5, 6, 8, 6, 5, 7, 7, 7, 5, 9, 9, 10, 11, 9, 8, 9, 9, 9, 6, 10, 10, 11, 12, 10, 9, 9, 10, 10, 8, 12, 12, 13, 14, 12, 11, 12, 12, 12, 9, 13, 13, 14, 15, 13, 12, 13, 13, 13, 8, 12, 12, 13, 14, 12, 11, 12, 12, 12, 11, 12, 13, 14, 16, 14, 13, 15, 15, 15, 12, 13

Offset: 0

M. F. Hasler, Nov 18 2009

Sequence A007005 is a variant of this sequence, where spaces and hyphens are counted.

In most languages, there exists a number N after which all numbers are written with fewer letters than the number itself. In English, in German and in French, N = 4. Here, if n > 4, then a(n) < n, and if n <= 4, then a(n) > n. - Bernard Schott, Jan 11 2019

			The terms a(0),...,a(16) represent the number of characters in the strings "zéro", "un", "deux", "trois", "quatre", "cinq", "six", "sept", "huit", "neuf", "dix", "onze", "douze", "treize", "quatorze", "quinze", "seize".
Since spaces and punctuation are not counted, a(n) is less than the length of the character string whenever the spelling of n contains hyphens, as in "dix-sept" (a(17)=7), or spaces as in "vingt et un" (a(21)=9).

Wiktionnaire, Annexe:Nombres de 1 à 100 en français (as of Nov. 18, 2009).
Index entries for sequences related to names of numbers

Cf. A005589 (English analog), A167508 (counts distinct letters).

Cf. A001050 (Finnish analog), A006994 (Russian analog), A007208 (German analog), A011762 (Spanish analog), A026858 (Italian analog).

apply( {A167507(n)=#[0|c<-Vecsmall(French(n)), c>96]}, [0..81]) \\ updated by M. F. Hasler, Feb 19 2020 [If old versions of PARI/gp give an error, use e.g. Vec(Vecsmall...).]
/* Helper function: spell out n in French. Extended to 10^24 (now further extensible via the 2nd optional argument) for A204593 on Feb 16 2012. */
French(n, t=[10^18,"trillion", /*10^15,"billiard",*/ 10^12,"billion", 10^9,"milliard", 10^6,"million"])={ if( n>999, n>=10^6*t[1] & error(n" is too large - this implementation is restricted to n < 10^",5+#Str(t[1])); forstep(i=1,#t,2, n\t[i] & return(Str(French(n\t[i])" "t[i+1], if(n\t[i]>1,"s",""), if(n%t[i],Str(" "French(n%t[i])),"")))); return(Str(if(n\1000>1,Str(French(n\1000)," "),""),"mille",if(n%1000,Str(" ", French(n%1000)),""))));
n<20 & return([ "zero","un","deux","trois","quatre","cinq","six","sept","huit","neuf", "dix","onze", "douze","treize","quatorze","quinze","seize","dix-sept","dix-huit","dix-neuf"][n+1]);
n >= 100 & return( Str( if( n>199, Str(French(n\100)," "), ""), "cent", if(n%100,Str(" ",French(n%100)),if(n>199,"s","")/*deux cents*/)));
n > 80 & return( Str( "quatre-vingt-", French( n-80 )));
n%10==0 & return( Str( ["vingt","trente","quarante","cinquante","soixante", "soixante-dix","quatre-vingts"][n\10-1] ));
Str( French((n\10-(n>70))*10), if(n%10==1," et ","-"), French(n%10+10*(n>70)))}
\\ M. F. Hasler, Nov 19 2009

Keyword "fini" removed by M. F. Hasler, Nov 19 2009

a(80) and a(81) corrected by Bernard Schott, Feb 19 2020

A007005 Number of characters in the French spelling of n, including spaces and hyphens.

Original entry on oeis.org

4, 2, 4, 5, 6, 4, 3, 4, 4, 4, 3, 4, 5, 6, 8, 6, 5, 8, 8, 8, 5, 11, 10, 11, 12, 10, 9, 10, 10, 10, 6, 12, 11, 12, 13, 11, 10, 11, 11, 11, 8, 14, 13, 14, 15, 13, 12, 13, 13, 13, 9, 15, 14, 15, 16, 14, 13, 14, 14, 14, 8, 14, 13, 14, 15, 13, 12, 13, 13, 13, 12, 16, 14, 15, 17, 15, 14

Offset: 0

Simon Plouffe

This sequence gives the number of characters, including spaces and hyphens, in the French spelling of the numbers; e.g., a(21) = 11 = #"vingt et un", a(22) = 10 = #"vingt-deux". - M. F. Hasler, Nov 18 2009
See A167507 for a variant where only letters are counted, but spaces and hyphens are not counted. - M. F. Hasler, Jun 03 2012
See A052360 for the English version (and A005589 for the letters-only variant); A007208 for the German version. - M. F. Hasler, Sep 20 2014
This refers to the official French spelling, Swiss or Belgian variants ("septante", ...) are not considered here. - M. F. Hasler, Sep 21 2014

			a(0) = 4 = #"zéro"
a(80) = 13 = #"quatre-vingts"
a(999) = 31 = #"neuf cent quatre-vingt-dix-neuf"
a(1000) = 5 = # "mille"

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

M. F. Hasler, Table of n, a(n) for n = 0..1000
Wiktionnaire, Annexe:Nombres de 1 à 100 en français. [From _M. F. Hasler_, Nov 18 2009]
Index entries for sequences related to number of letters in n

Cf. A005589, A007208, A052360, A167507.

A007005(n)=#French(n)   /* cf. A167507 for PARI code of "French()" - M. F. Hasler, Jun 03 2012 */

a(71) and a(74) corrected by M. F. Hasler, Jun 03 2012

Example completed by Rémy Sigrist, Sep 09 2018

A119945 Sum of numerical values of letters in German names of the nonnegative numbers.

Original entry on oeis.org

59, 47, 63, 36, 54, 52, 54, 54, 32, 54, 53, 23, 87, 89, 107, 105, 88, 88, 85, 107, 106, 173, 208, 181, 199, 197, 199, 199, 177, 199, 90, 157, 192, 165, 183, 181, 183, 183, 161, 183, 96, 163, 198, 171, 189, 187, 189, 189, 167, 189, 94, 161, 196, 169, 187, 185, 187, 187, 165

Offset: 0

Wolfdieter Lang, Jul 20 2006

Letters with umlauts are interpreted respectively as "ae" (which does not appear in this entry), "oe", "ue", and "sz" (sharp s) (as in the German name of 30 = "dreißig" -> "dreissig") as "ss" (not "sz").
According to the Reder reference only "zweihundertfuenf", 205 and "zweihundertsieben", 207, satisfy a(n)=n.
This sequence is ambiguous for numbers above 100 because one can use, for instance, for 101 "hundertundeins" or "hunderteins. To avoid such ambiguities one should always stick to the shorter version.
An alternate version of this sequence could ignore umlauts (i.e., take "a" for "ä" etc), or, more in-line with the German alphabet as it is usually listed in textbooks and reference works, taken as ä=27, ö=28, ü=29 (and then maybe ß=30, which could nonetheless remain considered as a ligature of "∫s"="ss"). - M. F. Hasler, Jun 23 2013
It appears that there is no canonical version of this sequence, because of the lack of agreement even on the number of letters in the German alphabet. - N. J. A. Sloane, Jun 11 2021

			"Null" for 0 in German has numerical values (a=1, b=2, ..., z=26) [14, 21, 12, 12] which sums up to a(0)=59.
The numerical values for "zweihundertfuenf" are [26, 23, 5, 9, 8, 21, 14, 4, 5, 18, 20, 6, 21, 5, 14, 6] with sum 205.
The numerical values for "zweihundertsieben" are [26, 23, 5, 9, 8, 21, 14, 4, 5, 18, 20, 19, 9, 5, 2, 5, 14] with sum 207.
From _Omar E. Pol_, Jun 15 2021: (Start)
-------------------------------------------------------------
   n     Name               Calculation                  a(n)
-------------------------------------------------------------
   0     Null               14 + 21 + 12 + 12           = 59
   1     Eins                5 +  9 + 14 + 19           = 47
   2     Zwei               26 + 23 +  5 +  9           = 63
   3     Drei                4 + 18 +  5 +  9           = 36
   4     Vier               22 +  9 +  5 + 18           = 54
   5     Fünf  --> Fuenf     6 + 21 +  5 + 14 +  6      = 52
   6     Sechs              19 +  5 +  3 +  8 + 19      = 54
   7     Sieben             19 +  9 +  5 +  2 +  5 + 14 = 54
   8     Acht                1 +  3 +  8 + 20           = 32
   9     Neun               14 +  5 + 21 + 14           = 54
  10     Zehn               26 +  5 +  8 + 14           = 53
  11     Elf                 5 + 12 +  6                = 23
  12     Zwölf --> Zwoelf   26 + 23 + 15 +  5 + 12 +  6 = 87
... (End)
a(16) = 88 because "sechzehn" => [19, 5, 3, 8, 26, 5, 8, 14] with sum 88, as for a(17) with "siebzehn" => [19, 9, 5, 2, 26, 5, 8, 14]. - _M. F. Hasler_, Apr 08 2023

Christian Reder, Wörter und Zahlen, Springer Verlag, Komet, Wien, 2000, p. 337.

Index entries for sequences related to German names of numbers

For analogs in other languages see A073327 (U.S. English), A169639 (French), A161406 (Spanish).

G(n, eins="eins")={my(s(n, p, z, e="ein")=n=divrem(n, p); if(n[2], Str(G(n[1]*p), G(n[2])), Str(G(n[1], e), z))); if(n<20, ["null", eins, "zwei", "drei", "vier", "fuenf", "sechs", "sieben", "acht", "neun", "zehn", "elf", "zwoelf", "dreizehn", "vierzehn", "fuenfzehn", "sechzehn", "siebzehn", "achtzehn", "neunzehn"][n+1], n<100 && n%10, Str(G(n%10, "ein"), "und", G(n\10*10)), n<100, ["zwanzig", "dreissig", "vierzig", "fuenfzig", "sechzig", "siebzig", "achtzig", "neunzig"][n\10-1], n<1000, s(n, 100, "hundert"), n<10^6, s(n, 1000, "tausend"), n<10^9, s(n, 10^6, if(n\10^6>1, " Millionen ", "e Million ")), n<10^12, s(n, 10^9, if(n\10^9>1, " Milliarden ", "e Milliarde ")))}
\\ extension to Billion, Billiarde, Trillion, Trilliarde, ... is obvious. See A007208 for a variant.
apply( {A119945(n)=vecsum([t%32|t<-Vecsmall(G(n)),t>64])}, [0..99])
\\ M. F. Hasler, Apr 08 2023

Edited by N. J. A. Sloane, Jun 10 2021

Corrected and extended by M. F. Hasler, Apr 08 2023

A233188 a(n) is the least number not smaller than the total number of letters in the German names for all terms up to and including a(n).

Original entry on oeis.org

4, 8, 11, 19, 30, 40, 48, 60, 68, 80, 89, 100, 117, 140, 158, 180, 199, 218, 240, 260, 279, 300, 305, 330, 348, 370, 390, 400, 410, 430, 450, 470, 489, 500, 519, 540, 560, 580, 598, 618, 640, 660, 680, 700, 705, 730, 750, 770, 790, 800, 811, 830, 850, 870, 889, 900, 919, 940, 960, 980, 998, 1011, 1030, 1050, 1069, 1090, 1110

Offset: 1

Eric Angelini and M. F. Hasler, Dec 05 2013

See A233187 for a variant using strict inequality, "larger" instead of "not smaller", in the definition. See A233184 and A233185 for related English and French versions.

E. Angelini, Cumulative quantity of letters used in a list of English number-names, SeqFan list, Dec 05 2013

a=0;k=0;for(n=1,99,until( k++ > a + A007208(k),); print1(k,","); a+=A007208(k))

A233187 a(n) is the least number larger than the total number of letters in the German names for all terms up to and including a(n).

Original entry on oeis.org

5, 9, 17, 30, 38, 50, 59, 70, 80, 88, 100, 111, 130, 150, 168, 190, 200, 211, 230, 250, 270, 289, 300, 319, 340, 360, 380, 398, 417, 440, 460, 478, 500, 504, 529, 550, 570, 590, 600, 611, 630, 650, 670, 690, 700, 720, 740, 760, 780, 800, 805, 830, 848, 870, 890, 900, 910, 930, 950, 970, 989, 1000, 1017, 1040, 1058, 1080, 1099

Offset: 1

Eric Angelini and M. F. Hasler, Dec 05 2013

German version of A233184 (English) and A233185 (French). See A233188 for a variant using weak inequality, "not smaller" instead of "larger", in the definition.

E. Angelini, Cumulative quantity of letters used in a list of English number-names, SeqFan list, Dec 05 2013

a=0;k=0;for(n=1,99,until( k++ > a + A007208(k),); print1(k,","); a+=A007208(k))

A075826 n minus (number of letters in English name of n).

Original entry on oeis.org

-4, -2, -1, -2, 0, 1, 3, 2, 3, 5, 7, 5, 6, 5, 6, 8, 9, 8, 10, 11, 14, 12, 13, 12, 14, 15, 17, 16, 17, 19, 24, 22, 23, 22, 24, 25, 27, 26, 27, 29, 35, 33, 34, 33, 35, 36, 38, 37, 38, 40, 45, 43, 44, 43, 45, 46, 48, 47, 48, 50, 55, 53, 54, 53, 55, 56, 58, 57, 58, 60, 63

Offset: 0

Jon Perry, Oct 14 2002

a(n) < 0 for n < 4, a(n) = 0 for n = 4 and a(n) > 0 for n > 4. - Bernard Schott, Feb 11 2020

The French variant would be n - A167507(n) = (-4, -1, -2, -2, -2, 1, 3, 3, 4, 5, 7, 7, 7, 7, 6, 9, 11, ...). The German variant would be n - A007208(n) = (-3, -2, -1, 0, 1, 1, 1, 4, 5, 6, 8, 7, 5, 6, 7, 8, 9, 10, ...). - M. F. Hasler, Mar 02 2020

			Seven contains 5 letters, therefore a(7) = 7 - 5 = 2.

GCHQ, The GCHQ Puzzle Book, Penguin, 2016. See pages 49 and 214.

Cf. A005589.

A075826(n)=n-A005589(n) \\ M. F. Hasler, Mar 02 2020

a(n) = n - A005589(n). - Michel Marcus, Feb 11 2020

Corrected and extended by David W. Wilson, Jul 04 2005

A228442 Ending letter of a(n) equals starting letter of a(n+1), when spelled out in German; always choose the smallest possible number not yet used and not ending the sequence.

Original entry on oeis.org

1, 6, 7, 9, 19, 900, 1000, 13, 901, 16, 905, 5, 15, 906, 17, 907, 908, 1001, 600, 1005, 500, 1006, 601, 605, 501, 606, 607, 909, 910, 911, 505, 506, 608, 1007, 912, 57, 913, 914, 915, 916, 917, 918, 919, 9000, 300, 1008, 1009, 9001, 609, 9005, 508, 1010, 9006, 610, 9007

Offset: 1

M. F. Hasler, Nov 02 2013

German version of A227865, a variant of A230862 without monotonicity.

We use "tausend" rather than "eintausend", in order to allow numbers ending in "t", like "hundert" and "acht".

			EinS, SechS, SiebeN, NeuN, NeunzehN, NeunhunderT, TausenD, DreizehN, NeunhunderteinS, SechzehN, NeunhundertfünF, FünF, FünfzehN, NeunhundertsechS, SiebzehN, NeunhundertsiebeN, NeunhundertachT, TausendeinS, SechshunderT, TausendfünF, FünfhunderT, TausendsechS, SechshunderteinS, SechshundertfünF, FünfhunderteinS, SechshundertsechS, SechshundertsiebeN, NeunhundertneuN, NeunhundertzehN, NeunhundertelF, FünfhundertfünF, FünfhundertsechS, SechshundertachT, TausendsiebeN, NeunhundertzwölF, FünfhundertsiebeN, NeunhundertdreizehN, NeunhundertvierzehN, NeunhundertfünfzehN, NeunhundertsechzehN, NeunhundertsiebzehN, NeunhundertachtzehN, NeunhundertneunzehN, NeuntausenD, DreihunderT, TausendachT, TausendneuN, NeuntausendeinS, SechshundertneuN, NeuntausendfünF, FünfhundertachT, TausendzehN, NeuntausendsechS, SechshundertzehN, NeuntausendsiebeN, ...

E. Angelini, Re: A sequence in your style, SeqFan list, Nov 01 2013
OEIS Index entries for sequences related to German names of numbers

Cf. A227865, A230862.

/* Warning: Beyond n=150, the script may yield wrong results.*/
{A228442(Nmax, letters=Vec("dfnst"), values=[[3, 13], [5, 15], [9, 19], [6, 7, 16, 17], [10]],counter=[-1, 0, 0, 0, -1])= my(ok(n)=setsearch(letters, Vec(n=German(n))[#n]),a,ini,i); vector(Nmax,k, a=if(k>1, if(counter[i=setsearch(letters, ini=Vec(a=German(a))[#a])]>0, until(ok(counter[i]++), counter[i]%100<20&&next; Vec(German(counter[i]+=80))[1] != ini && counter[i] = values[i][1]*1000; break); counter[i], if(-counter[i]-->#values[i], counter[i]=values[i][1]*100, values[i][-counter[i]] )),1))} /* see A007208 for German() and A227865 for spellout() if you wish to capitalize initial and final letters */

cp's OEIS Frontend

A005589 Number of letters in the US English name of n, excluding spaces and hyphens.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Python

Extensions

A167507 Number of letters in the French spelling of the number n, not counting hyphens and spaces.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Extensions

A007005 Number of characters in the French spelling of n, including spaces and hyphens.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

PARI

Extensions

A119945 Sum of numerical values of letters in German names of the nonnegative numbers.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

PARI

Extensions

A233188 a(n) is the least number not smaller than the total number of letters in the German names for all terms up to and including a(n).

Views

Author

Keywords

Comments

Links

Programs

PARI

A233187 a(n) is the least number larger than the total number of letters in the German names for all terms up to and including a(n).

Views

Author

Keywords

Comments

Links

Programs

PARI

A075826 n minus (number of letters in English name of n).

Views

Author

Keywords

Comments

Examples

References

Crossrefs

Programs

PARI

Formula

Extensions

A228442 Ending letter of a(n) equals starting letter of a(n+1), when spelled out in German; always choose the smallest possible number not yet used and not ending the sequence.

Views