|
%I #3 Mar 31 2012 13:22:16
%S 1,1,0,0,1,0,0,0,0,1,2,2,1,1,2,1,2,1,1,2,1,1,0,0,1,1,0,0,0,1,1,1,0,0,
%T 1,0,1,0,0,1,2,2,1,1,2,1,1,1,1,3,1,1,0,0,1,0,0,0,0,1,1,1,0,0,2,0,0,0,
%U 0,1,1,1,0,0,1,0,0,0,0,1,1,2,0,0,1,0,0,0,0,1,2,2,1,1,2,1,1,1,1,2,4,3,2,2,3
%N Number of squares that appear as substrings in n.
%e a(10)=2 since 1 and 0 are squares. a(164)=4 since 1, 16, 64 and 4 are squares
%K nonn
%O 0,11
%A _Erich Friedman_
|
