|
%I M4958 #31 Aug 27 2023 19:28:56
%S 26,15,20,20,6,6,19,19,5,14,20,5,20,20,6,6,19,19,5,14,20,20,20,20,20,
%T 20,20,20,20,20,20,20,20,20,20,20,20,20,20,20,6,6,6,6,6,6,6,6,6,6,6,6,
%U 6,6,6,6,6,6,6,6,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19
%N Position of first letter of n (in English) in alphabet.
%C English name for n begins with a(n)-th letter.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H Harvey P. Dale, <a href="/A005606/b005606.txt">Table of n, a(n) for n = 0..1000</a>
%H Chris Cole, <a href="/A005606/a005606.pdf">Email to N. J. A. Sloane, Apr 23 1994</a> (contains many letter sequences, including the letter equivalent of A005606).
%e 'One' begins with 'O' and 'O' is the fifteenth letter hence a(1)=15.
%t Table[LetterNumber[Characters[IntegerName[n,"Words"]][[1]]],{n,0,80}] (* _Harvey P. Dale_, Jun 06 2016 *)
%o (Python)
%o from num2words import num2words
%o def a(n): return ord(num2words(n)[0]) - 96
%o print([a(n) for n in range(78)]) # _Michael S. Branicky_, Jul 12 2022
%K word,nonn,nice,easy
%O 0,1
%A _N. J. A. Sloane_
%E More terms from Larry Reeves (larryr(AT)acm.org), Oct 02 2000
|
