A347534 Number of partitions of n into at most 3 distinct squares.

1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 2, 2, 0, 0, 2, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 2, 1, 0, 0, 2, 1, 0, 0, 2, 2, 0, 1, 2, 1, 0, 1, 0, 1, 1, 0, 2, 2, 0, 1, 3, 1, 0, 1, 2, 1, 0, 0, 1, 3, 1, 0, 2, 1, 0, 1, 2, 1, 1, 1, 2, 2

Offset

0,26

Links

Alois P. Heinz, Table of n, a(n) for n = 0..20000

Index entries for sequences related to sums of squares

Formula

a(n) = Sum_{k=0..3} A341040(n,k). - Alois P. Heinz, Sep 08 2021

Mathematica

a[n_] := IntegerPartitions[n, 3, Select[Range[n], IntegerQ@Sqrt[#]&]] // Select[#, Union[#] == Sort[#]&]& // Length;
Table[a[n], {n, 0, 100}] (* Jean-François Alcover, Sep 13 2021 *)

Crossrefs

Cf. A000290, A025435, A025442, A033461, A341040.

Sequence in context: A239395 A182004 A179851 * A134015 A113406 A151851

Adjacent sequences: A347531 A347532 A347533 * A347535 A347536 A347537

Keyword

nonn

Author

Ilya Gutkovskiy, Sep 08 2021

Status

approved