|
%I #13 Mar 05 2013 23:44:04
%S 1,2,0,1,3,0,2,2,2,0,4,2,0,3,2,4,0,1,4,0,3,5,0,1,4,2,0,4,3,0,4,1,6,0,
%T 3,3,0,2,6,0,2,4,2,0,6,3,0,2,4,7,0,1,4,0,2,5,2,0,6,2,0,5,5,0,3,1,8,0,
%U 3,5,0,1,5,2,0,4,4,0,8,3,0,3,2,7,0,1,4,0,5,6
%N The number of numbers [ [ ix ]jx ] that equal n, where i >= 1, j >= 1 and x=sqrt(2).
%C a(n) = 0 if and only if n is in the Beatty sequence A001952.
%H <a href="/index/Be#Beatty">Index entries for sequences related to Beatty sequences</a>
%o (PARI) a(n)=sum(i=1,sqrtint((n^2+2*n+2)^2\8),my(k=sqrtint(2*i^2));sqrtint(sqrtint( (n+1)^2\k^2\2)^2*2*k^2)==n) \\ _Charles R Greathouse IV_, Mar 05 2013
%K nonn
%O 1,2
%A _Clark Kimberling_
|
