Athanasius, thanks for your interesting write-up. Here is a little version using vec for storing which numbers have been seen already. It runs quite happily until it hits integer overflow... It only prints a line when the maximum observed or the minimum unobserved increases. 

use strict;
use warnings;

my $min = 2; # smallest unused number
my $max = 3; # largest number already visited
my $n   = 2;
my $r   = 3;
my $s;
vec($s,$_,1)=1 for (0,1,3);
my $flag = 1;
while(++$n){
    $r += ($r-$n>0) && not( vec($s,$r-$n,1) ) ? -$n : $n;
    vec($s,$r,1)=1;
    $min++, $flag=1 while vec($s,$min,1);
    $max = $r, $flag=1 if $r > $max;
    print "$n\t$max\t$min\t$r\t".length($s)."\n" if $flag;
    $flag = 0;
}

[download]

In reply to Re: Recamán's sequence and memory usage by hdb
in thread Recamán's sequence and memory usage by Athanasius

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post, it's "PerlMonks-approved HTML":


  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.