This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A064288 #24 May 10 2020 13:46:47 %S A064288 0,1,2,2,7,7,3,3,4,4,4,4,4,4,5,5,5,5,5,18,5,5,5,5,5,5,6,6,6,6,6,6,6,6, %T A064288 6,6,6,6,6,6,7,6,6,6,6,6,6,8,8,8,8,8,8,8,8,8,8,8,8,8,8,19,7,7,7,7,7,7, %U A064288 7,7,7,7,7,7,7,7,19,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,9,9,9,9,9,9,9,9 %N A064288 Height of n when it appears for first time in Recamán's sequence A005132. %C A064288 The height of a term in A005132 = number of addition steps - number of subtraction steps to produce it (see A064289). %H A064288 Rémy Sigrist, <a href="/A064288/b064288.txt">Table of n, a(n) for n = 0..1354</a> %H A064288 Rémy Sigrist, <a href="/A064288/a064288.txt">C program for A064288</a> %H A064288 N. J. A. Sloane, <a href="/A005132/a005132.txt">FORTRAN program for A005132, A057167, A064227, A064228</a> %H A064288 <a href="/index/Rea#Recaman">Index entries for sequences related to Recamán's sequence</a> %e A064288 A005132 begins 0, 1, 3, 6, 2, 7, 13, 20, 12, ... and these terms have heights 0, 1, 2, 3, 2, 3, 4, 5, 4, ... %o A064288 (C) See Links section. %Y A064288 Cf. A005132, A064289, A064290, A064291, A064292, A064293, A064294. %K A064288 nonn %O A064288 0,3 %A A064288 _N. J. A. Sloane_, Sep 25 2001 %E A064288 a(0)=0 added by _N. J. A. Sloane_, May 01 2020