%I A065462
%S A065462 1,2,3,5,8,11,18,25,36,51,73,90,133,169,223,295,380,452,603,763,903,
%T A065462 1115,1385,1668,2025,2398,2811,3535,4011,4683,5503,6724,7316,8684,9946,
%U A065462 11844
%N A065462 Number of inequivalent (ordered) solutions to n^2 = sum of 8 squares 
               of integers >= 0.
%e A065462 a(4)=5 because 16 produces {0,0,0,0,0,0,0,4},{0,0,0,0,2,2,2,2},{0,0,0,
               1,1,1,2,3},{0,1,1,1,1,2,2,2},{ 1,1, 1,1,1,1,1,3}
%t A065462 Length/@Table[SumOfSquaresRepresentations[8, (k)^2], {k, 36}]
%Y A065462 A063014, A016727
%Y A065462 Sequence in context: A000511 A135908 A056891 this_sequence A062762 A004693 
               A119014
%Y A065462 Adjacent sequences: A065459 A065460 A065461 this_sequence A065463 A065464 
               A065465
%K A065462 nonn
%O A065462 1,2
%A A065462 Wouter Meeussen, Nov 18, 2001