login
a(n) = A097249(A260443(n)).
5

%I #17 Nov 16 2016 11:07:36

%S 0,0,0,0,0,1,0,0,0,2,1,2,0,1,0,0,0,3,2,3,1,3,2,2,0,2,1,2,0,1,0,0,0,4,

%T 3,4,2,4,3,3,1,3,3,3,2,3,2,2,0,3,2,3,1,3,2,2,0,2,1,2,0,1,0,0,0,5,4,5,

%U 3,5,4,4,2,4,4,4,3,4,3,4,1,4,3,4,3,4,3,4,2,4,3,4,2,3,2,2,0,4,3,4,2,4,3,3,1,3,3,3,2,3,2,3,0,3,2,3,1,3,2,2,0

%N a(n) = A097249(A260443(n)).

%C a(n) = number of times we must iterate A097246, starting at A260443(n), before the result is squarefree.

%H Antti Karttunen, <a href="/A277899/b277899.txt">Table of n, a(n) for n = 0..8192</a>

%F a(n) = A097249(A260443(n)).

%o (Scheme)

%o (define (A277899 n) (A097249_for_coeff_list (A260443as_coeff_list n)))

%o (define (A097249_for_coeff_list nums) (let loop ((nums nums) (s 0)) (if (<= (reduce max 0 nums) 1) s (loop (A097246_for_coeff_list nums) (+ 1 s)))))

%o (define (A097246_for_coeff_list nums) (add_two_lists (map A000035 nums) (cons 0 (map A004526 nums))))

%o ;; For the other required functions, see A260443.

%Y Cf. A097246, A097249, A260443, A277905.

%Y Cf. A023758 (positions of zeros).

%K nonn

%O 0,10

%A _Antti Karttunen_, Nov 15 2016