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

Search: id:a025444
Showing 1-1 of 1

%I A025444 #18 Feb 03 2021 15:43:54
%S A025444 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
%T A025444 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,
%U A025444 0,0,0,0,0,0,0,1,0,0,0,1,0,0,1,0,0,0,0,1,1,0,1,0,0,0,1,1,0,0,0,1,1,0,0,2,0,0,1,0
%N A025444 Number of partitions of n into 5 distinct nonzero squares.
%H A025444 David A. Corneth, <a href="/A025444/b025444.txt">Table of n, a(n) for n = 0..9999</a>
%H A025444 <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
%F A025444 a(n) = [x^n y^5] Product_{k>=1} (1 + y*x^(k^2)). - _Ilya Gutkovskiy_, Apr 22 2019
%e A025444 a(111) = 2 via 1 + 4 + 9 + 16 + 81 = 1 + 9 + 16 + 36 + 49. - _David A. Corneth_, Feb 02 2021
%p A025444 From _R. J. Mathar_, Oct 18 2010: (Start)
%p A025444 A025444aux := proc(n,m,nmax) local a,m,upn,lv ; if m = 1 then if issqr(n) and nmax^2 >= n and n >= 1 then return 1; else return 0; end if; else a := 0 ; for upn from 1 to nmax do lv := n-upn^2 ; if lv <0 then break; end if; a := a + procname(lv,m-1,upn-1) ; end do: return a; end if; end proc:
%p A025444 A025444 := proc(n) A025444aux(n,5,n) ; end proc: (End)
%Y A025444 Cf. A000290, A008452, A010052, A025433, A025441, A025442, A025443, A025444, A045851, A340946, A340988, A340998, A340999, A341000, A341001.
%Y A025444 Column k=5 of A341040.
%K A025444 nonn,look
%O A025444 0,104
%A A025444 _David W. Wilson_

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