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 A130535 #16 Aug 08 2019 14:43:15 %S A130535 1,1,2,2,2,3,3,3,4,4,4,4,4,4,4,4,4,4,4,4,4,5,5,4,5,5,5,6,5,5,6,6,6,6, %T A130535 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,7,7,6,7,7,6,7,7,7,8,7,7,8,7,7,8,8,8,8, %U A130535 8,8,8,8,8,8,8,8,8,8,8,8,8 %N A130535 a(0)=a(1)=1; a(n+2) = a(floor((n+1)/a(n+1))) + a(floor(n/a(n))). %C A130535 The sequence is unbounded. - _Rémy Sigrist_, Aug 08 2019 %H A130535 Rémy Sigrist, <a href="/A130535/b130535.txt">Table of n, a(n) for n = 0..10000</a> %H A130535 Rémy Sigrist, <a href="/A130535/a130535.txt">C program for A130535</a> %p A130535 a[0]:=1: a[1]:=1: for n from 0 to 80 do a[n+2]:= a[floor((n+1)/a[n+1])]+a[floor(n/a[n])] end do: seq(a[n],n=0..80); # _Emeric Deutsch_, Aug 13 2007 %o A130535 (C) See Links section. %Y A130535 Cf. A130147. %K A130535 nonn,look,easy %O A130535 0,3 %A A130535 _Leroy Quet_, Aug 09 2007 %E A130535 More terms from _Emeric Deutsch_, Aug 13 2007