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 A262682 #5 Oct 03 2015 08:44:57 %S A262682 0,0,2,0,2,0,0,0,2,0,0,0,2,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0, %T A262682 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, %U A262682 0,0,0,0,2,0,0,0,2,0,2,0,0,2,0,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2 %N A262682 Even bisection of A262680. %C A262682 Number of perfect squares (A000290) encountered before zero is reached when starting from k = 2n and repeatedly applying the map that replaces k by k - d(k), where d(k) is the number of divisors of k (A000005). This count includes n itself if it is a square, but excludes the zero. %H A262682 Antti Karttunen, <a href="/A262682/b262682.txt">Table of n, a(n) for n = 0..10082</a> %F A262682 a(n) = A262680(2*n). %o A262682 (Scheme) (define (A262682 n) (A262680 (+ n n))) %Y A262682 Cf. A000005, A000290, A010052, A049820, A155043, A262677, A262680, A262681. %K A262682 nonn %O A262682 0,3 %A A262682 _Antti Karttunen_, Oct 03 2015