|
%I #5 Oct 03 2015 08:44:48
%S 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 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 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 Odd bisection of A262680.
%C 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 Antti Karttunen, <a href="/A262681/b262681.txt">Table of n, a(n) for n = 0..10082</a>
%F a(n) = A262680((2*n)+1).
%o (Scheme) (define (A262681 n) (A262680 (+ n n 1)))
%Y Cf. A000005, A000290, A010052, A049820, A155043, A262677, A262680, A262682.
%K nonn
%O 0,85
%A _Antti Karttunen_, Oct 03 2015
|
