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 A078759 #8 Oct 30 2022 18:19:59 %S A078759 1,2,3,2,3,4,5,4,5,4,5,4,5,4,5,4,5,6,7,6,7,6,5,6,5,6,7,8,7,8,7,6,5,6, %T A078759 5,6,7,8,7,6,7,8,9,8,7,6,7,6,7,6,7,8,9,8,9,8,7,6,7,8,9,8,9,8,9,8,9,8, %U A078759 7,8,9,10,9,10,9,8,7,8,7,8,9,10,9,10,9,10,9,8,9,10,11,10,11,10,9,8,9,8,9,10 %N A078759 Height of n-th term in A064389 (variation (4) of Recamán's sequence). %H A078759 Nick Hobson, <a href="/A078759/b078759.txt">Table of n, a(n) for n=1..10000</a> %H A078759 Nick Hobson, <a href="/A078759/a078759.py.txt">Python program for this sequence</a> %F A078759 The height of a term in A064389 = number of addition steps - number of subtraction steps to produce it. %Y A078759 Cf. A005132, A064289, A064389. %K A078759 nonn %O A078759 1,2 %A A078759 _Reiner Martin_, Jan 08 2003