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 A262681 #5 Oct 03 2015 08:44:48 %S A262681 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, %T A262681 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, %U A262681 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,3,1,1,3,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,3,3,3,1 %N A262681 Odd bisection of A262680. %C A262681 Number of perfect squares (A000290) encountered before zero is reached when starting from k = 2n+1 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 A262681 Antti Karttunen, <a href="/A262681/b262681.txt">Table of n, a(n) for n = 0..10082</a> %F A262681 a(n) = A262680((2*n)+1). %o A262681 (Scheme) (define (A262681 n) (A262680 (+ n n 1))) %Y A262681 Cf. A000005, A000290, A010052, A049820, A155043, A262677, A262680, A262682. %K A262681 nonn %O A262681 0,85 %A A262681 _Antti Karttunen_, Oct 03 2015