|
%I #23 Apr 23 2023 22:13:00
%S 0,0,2,0,2,4,2,1,6,9,8,3,8,6,5,0,7,1,10,7,15,11,2,23,24,3,10,16,4,10,
%T 10,30,24,24,2,8,17,35,25,4,36,16,11,12,36,44,8,37,28,16,49,20,16,18,
%U 53,6,17,57,49,37,9,31,27,29,9,17,28,10,1,40,2,24,20,22,2,10,21,3
%N Remainder modulo n of the sum of the letters of the English word(s) for n (A073327: a=1, ..., z=26).
%C By definition, a(n) < n so iterated application of this function to any initial value n will create a strictly decreasing sequence ending in 0.
%H Robert Israel, <a href="/A226911/b226911.txt">Table of n, a(n) for n = 1..10000</a>
%H M. Hasler in reply to E. Angelini, <a href="http://list.seqfan.eu/oldermail/seqfan/2013-June/011350.html">English number words modulo themselves</a>, SeqFan list, Jun 21 2013
%F a(n) = A073327(n) mod n.
%F It appears that a(n) = A073327(n) for n > 279. - _Robert Israel_, Jun 12 2019
%p f:= proc(n) local S;
%p uses StringTools;
%p S:= Select(IsAlpha,convert(n,english));
%p convert(map(`-`,convert(S,bytes),96),`+`) mod n
%p end proc:
%p map(f, [$1..100]); # _Robert Israel_, Jun 12 2019
%t a[n_] := Mod[Total@ Flatten[ ToCharacterCode[#] - 96 & /@ Characters@ StringDelete[ IntegerName[n], Except@ LetterCharacter]], n] (* after _Michael De Vlieger_ in A362065 *); Array[a, 78] (* _Robert G. Wilson v_, Apr 22 2023 *)
%o (PARI) A226911 = n->A073327(n)%n
%Y Cf. A073029, A119945, A072922, A075831, A152611, A052360, A362065.
%K nonn,word,look
%O 1,3
%A _Eric Angelini_ and _M. F. Hasler_, Jun 22 2013
|
