# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a084966
Showing 1-1 of 1

%I A084966 #6 Jul 09 2023 02:15:47
%S A084966 1,2,3,3,3,2,3,3,3,4,3,4,3,3,3,3,3,3,3,3,3,3,3,4,4,3,3,3,3,3,3,3,3,3,
%T A084966 3,3,3,3,3,3,3,3,3,3,3,3,3,4,4,3,3,3,3,4,3,3,3,3,3,4,3,3,3,3,3,3,3,3,
%U A084966 3,3,3,3,3,3,3,3,3,4,3,3,3,3,3,3,3,3,3,3,3,3,4,3,3,3,3,4,4,3,3,3,3,3,3,3,3
%N A084966 Minimum numbers of squares needed to write n! as a sum of nonzero squares.
%H A084966 Dario Alpern, <a href="https://www.alpertron.com.ar/FSQUARES.HTM">Sum of squares web application</a>
%e A084966 a(2)=2 because 2!=1^2+1^2; a(3)=3: 3!=6=2^2+1+1; a(6)=2: 6!=720=24^2+12^2
%o A084966 See link.
%Y A084966 Cf. A000142, A001481, A000419, A004215, A084953.
%K A084966 nonn
%O A084966 1,2
%A A084966 _Hugo Pfoertner_, Jun 15 2003

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE