%I A064228
%S A064228 1,2,4,19,61,879,1355,2406
%N A064228 From Recaman's sequence (A005132): values of n achieving records in A057167.
%C A064228 If R(n) is the n-th term of Recaman's sequence (A005132), sequence gives 
               values of R(n) that take a record number of steps to appear. A064227 
               gives corresponding values of n.
%H A064228 N. J. A. Sloane, <a href="http://www.research.att.com/~njas/doc/sg.txt">
               My favorite integer sequences</a>, in Sequences and their Applications 
               (Proceedings of SETA '98).
%H A064228 N. J. A. Sloane, <a href="a005132.txt">FORTRAN program for A005132, A057167, 
               A064227, A064228</a>
%H A064228 <a href="Sindx_Rea.html#Recaman">Index entries for sequences related 
               to Recaman's sequence</a>
%Y A064228 Cf. A005132, A057167, A064227.
%Y A064228 Sequence in context: A131578 A018273 A047092 this_sequence A058130 A046082 
               A048774
%Y A064228 Adjacent sequences: A064225 A064226 A064227 this_sequence A064229 A064230 
               A064231
%K A064228 nonn,nice,hard
%O A064228 1,2
%A A064228 N. J. A. Sloane (njas(AT)research.att.com), Sep 22 2001
%E A064228 a(7) and a(8) from Allan Wilks (allan(AT)research.att.com), Nov 06, 2001. 
               After 10^15 terms of A005132 the smallest missing number is 852655.
%E A064228 After 10^25 terms of A005132 the smallest missing number is still 852655. 
               - Benjamin Chaffin (chaffin(AT)gmail.com), Jun 13 2006