%I #21 Feb 26 2023 16:37:13
%S 0,1,2,4,19,61,879,1355,2406
%N From Recamán's sequence (A005132): values of n achieving records in A057167.
%C If R(n) is the n-th term of Recamán'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 N. J. A. Sloane, <a href="http://neilsloane.com/doc/sg.txt">My favorite integer sequences</a>, in Sequences and their Applications (Proceedings of SETA '98).
%H N. J. A. Sloane, <a href="/A005132/a005132.txt">FORTRAN program for A005132, A057167, A064227, A064228</a>
%H <a href="/index/Rea#Recaman">Index entries for sequences related to Recamán's sequence</a>
%Y Cf. A005132, A057167, A064227.
%K nonn,nice,hard
%O 1,3
%A _N. J. A. Sloane_, Sep 22 2001
%E a(8) and a(9) from _Allan Wilks_, Nov 06 2001. After 10^15 terms of A005132, the smallest missing number was 852655.
%E After 10^25 terms of A005132 the smallest missing number is still 852655. - _Benjamin Chaffin_, Jun 13 2006
%E Even after 4.28*10^73 terms, the smallest missing number is still 852655. - _Benjamin Chaffin_, Mar 22 2010
%E Even after 10^230 terms, the smallest missing number is still 852655. - _Benjamin Chaffin_, 2018
%E Initial term 0 added by _N. J. A. Sloane_, Feb 26 2023