Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #52 May 02 2022 22:02:59
%S 1,34,160,224,318,222,316,245,277,326,308,198,263,304,209,193,270,261,
%T 282,283,281,259,259,259,259,259,259,259,259,259,259,259,259,259,259,
%U 259,259,259,259,259,259,259,259,259,259,259,259,259,259,259,259,259,259
%N a(1) = 1; thereafter, a(n) = A073327(a(n-1)), using the British English version of A073327 when there is a choice.
%C This sequence uses UK English names (e.g., one hundred and one).
%C Theorem: All nonnegative integers eventually reach either the fixed point 251, the fixed point 259, or the five-cycle 248, 284, 285, 267, 313.
%e a(1) = 1 = ONE => A073327(1) = 34,
%e a(2) = 34 = THIRTY FOUR => A073327(34) = 160,
%e a(3) = 160 = ONE HUNDRED AND SIXTY => A073327(160) = 224, and so on.
%o (PARI) lista(nn) = {my(x=1); for (n=1, nn, x = A073327(x); print1(x, ", "););} \\ _Michel Marcus_, Jul 01 2021; using PARI for A073327
%Y Cf. A073327, A345157.
%Y See also A345240 (a Spanish version).
%K nonn,word
%O 1,2
%A _Paul Duckett_, Jun 08 2021
%E Edited by _N. J. A. Sloane_, Jun 09 2021
%E Corrected (at the suggestion of Stephen Cornelius) and extended by _Sean A. Irvine_, May 01 2022