The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A347534 Number of partitions of n into at most 3 distinct squares. 2
 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 (list; graph; refs; listen; history; text; internal format)
 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 25 02:17 EST 2024. Contains 370308 sequences. (Running on oeis4.)