login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of compositions (ordered partitions) of n into at most 3 squares.
3

%I #7 Sep 11 2021 10:25:17

%S 1,1,1,1,1,2,3,0,1,4,2,3,1,2,6,0,1,5,4,3,2,6,3,0,3,3,8,4,0,8,6,0,1,6,

%T 5,6,4,2,9,0,2,11,6,3,3,8,6,0,1,7,9,6,2,8,12,0,6,6,2,9,0,8,12,0,1,10,

%U 12,3,5,12,6,0,4,5,14,7,3,12,6,0,2

%N Number of compositions (ordered partitions) of n into at most 3 squares.

%H <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>

%F a(n) = Sum_{k=0..3} A337165(n,k). - _Alois P. Heinz_, Sep 10 2021

%Y Cf. A000290, A002654, A006456, A063691, A337165, A347711, A347712, A347713.

%K nonn

%O 0,6

%A _Ilya Gutkovskiy_, Sep 10 2021