%I A064227
%S A064227 1,4,131,99734,181653,328002,325374625245,394178473633984
%N A064227 From Recaman's sequence (A005132): record values in A057167.
%C A064227 Let R(n) = n-th term of Recaman's sequence (A005132); consider values 
               of R(n) that take a record number of steps to appear (A064228); sequence 
               gives corresponding values of n.
%H A064227 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 A064227 N. J. A. Sloane, <a href="a005132.txt">FORTRAN program for A005132, A057167, 
               A064227, A064228</a>
%H A064227 <a href="Sindx_Rea.html#Recaman">Index entries for sequences related 
               to Recaman's sequence</a>
%Y A064227 Cf. A005132, A057167, A064228.
%Y A064227 Sequence in context: A006103 A003371 A113253 this_sequence A146547 A045482 
               A006429
%Y A064227 Adjacent sequences: A064224 A064225 A064226 this_sequence A064228 A064229 
               A064230
%K A064227 nonn,nice,hard
%O A064227 1,2
%A A064227 N. J. A. Sloane (njas(AT)research.att.com), Sep 22 2001
%E A064227 a(7) and a(8) from Allan Wilks (allan(AT)research.att.com), Nov 06, 2001
%E A064227 a(9) > 10^25. - Benjamin Chaffin (chaffin(AT)gmail.com), Jun 13 2006