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 A277899 #17 Nov 16 2016 11:07:36 %S A277899 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 A277899 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 A277899 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 A277899 a(n) = A097249(A260443(n)). %C A277899 a(n) = number of times we must iterate A097246, starting at A260443(n), before the result is squarefree. %H A277899 Antti Karttunen, <a href="/A277899/b277899.txt">Table of n, a(n) for n = 0..8192</a> %F A277899 a(n) = A097249(A260443(n)). %o A277899 (Scheme) %o A277899 (define (A277899 n) (A097249_for_coeff_list (A260443as_coeff_list n))) %o A277899 (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 A277899 (define (A097246_for_coeff_list nums) (add_two_lists (map A000035 nums) (cons 0 (map A004526 nums)))) %o A277899 ;; For the other required functions, see A260443. %Y A277899 Cf. A097246, A097249, A260443, A277905. %Y A277899 Cf. A023758 (positions of zeros). %K A277899 nonn %O A277899 0,10 %A A277899 _Antti Karttunen_, Nov 15 2016