|
%I #11 Dec 02 2013 01:01:04
%S 1,1,0,1,0,0,0,1,0,0,0,0,0,0,0,6,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,1,0,0,
%T 0,0,0,0,0,3,0,0,0,0,0,0,0,1,0,0,0,12,0,0,0,1,0,0,0,0,0,0,0,3,0,0,0,1,
%U 0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,8,0,0,0,0,0,0,0,1,0,0,0,3,0,0,0,1,0
%N Number of different initial values for 3x+1 trajectories of which the largest term appearing during the iteration equals n.
%H Jon E. Schoenfield, <a href="/A087255/b087255.txt">Table of n, a(n) for n = 1..10000</a>
%e a(2k+1)=a(4k+2)=a(16k+12)=0 because larger values appear in iteration: 6k+4, 6k+4, and 18k+16, respectively. Exception: a(1)=a(2)=1.
%e Some outstanding cases: a(9232)=1579, a(13120)=75.
%Y Cf. A025586, A087251-A087254.
%K nonn
%O 1,16
%A _Labos Elemer_, Sep 08 2003
%E Edited by _Jon E. Schoenfield_, Dec 01 2013
|
