login

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”).

A217729
Trajectory of 40 under the map n-> A006369(n).
16
40, 53, 71, 95, 127, 169, 225, 150, 100, 133, 177, 118, 157, 209, 279, 186, 124, 165, 110, 147, 98, 131, 175, 233, 311, 415, 553, 737, 983, 1311, 874, 1165, 1553, 2071, 2761, 3681, 2454, 1636, 2181, 1454, 1939, 2585, 3447, 2298, 1532, 2043, 1362, 908, 1211, 1615
OFFSET
1,1
COMMENTS
It is conjectured that this trajectory does not close on itself.
LINKS
J. H. Conway, On unsettleable arithmetical problems, Amer. Math. Monthly, 120 (2013), 192-198.
MAPLE
f:=proc(N) if N mod 3 = 0 then 2*(N/3); elif N mod 3 = 2 then 4*((N+1)/3)-1; else 4*((N+2)/3)-3; fi; end;
t1:=[40];
for n from 1 to 100 do t1:=[op(t1), f(t1[nops(t1)])]; od:
t1;
MATHEMATICA
t = {40}; While[n = t[[-1]]; s = Switch[Mod[n, 3], 0, 2*n/3, 1, (4*n - 1)/3, 2, (4*n + 1)/3]; Length[t] < 100 && ! MemberQ[t, s], AppendTo[t, s]]; t (* T. D. Noe, Mar 22 2013 *)
SubstitutionSystem[{n_ :> Switch[Mod[n, 3], 0, 2n/3, 1, (4n - 1)/3, _, (4n + 1)/3]}, {40}, 60] // Flatten (* Jean-François Alcover, Mar 01 2019 *)
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Mar 22 2013
STATUS
approved