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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A297930 Number of partitions of n into 2 squares and 2 nonnegative cubes. 1

%I #25 Sep 12 2018 02:42:08

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

%T 6,4,6,6,4,2,4,6,4,4,4,7,3,2,4,3,5,4,7,8,5,3,3,3,5,5,5,6,4,3,6,7,8,7,

%U 5,7,4,2,7,9,10,4,5,7,3,3,9,10,8,5,4,7

%N Number of partitions of n into 2 squares and 2 nonnegative cubes.

%C For n <= 6 * 10^7, except for a(23) = 0, all a(n) > 0.

%C First occurrence of k beginning with 0: 23, 7, 1, 2, 9, 10, 18, 45, 53, 73, 74, 101, 125, 146, 165, 197, ..., . - _Robert G. Wilson v_, Jan 14 2018

%H W. Jagy and I. Kaplansky, <a href="https://projecteuclid.org/euclid.em/1062621075">Sums of Squares, Cubes and Higher Powers</a>, Experimental Mathematics, vol. 4 (1995) pp. 169-173.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/WaringsProblem.html">Waring's Problem</a>

%e 2 = 0^2 + 0^2 + 1^3 + 1^3 = 0^2 + 1^2 + 0^3 + 1^3 = 1^2 + 1^2 + 0^3 + 0^3, a(2) = 3.

%e 10 = 0^2 + 1^2 + 1^3 + 2^3 = 0^2 + 3^2 + 0^3 + 1^3 = 1^2 + 1^2 + 0^3 + 2^3 = 1^2 + 3^2 + 0^3 + 0^3 = 2^2 + 2^2 + 1^3 + 1^3, a(10) = 5.

%t a[n_] := Sum[If[x^2 + y^2 + z^3 + u^3 == n, 1, 0], {x, 0, n^(1/2)}, {y, x, (n - x^2)^(1/2)}, {z, 0, (n - x^2 - y^2)^(1/3)}, {u, z, (n - x^2 - y^2 - z^3)^(1/3)}]; Table[a[n], {n, 0, 86}]

%Y Cf. A000164, A002635, A022552, A274274.

%K nonn

%O 0,2

%A _XU Pingya_, Jan 08 2018

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 06:45 EDT 2024. Contains 371906 sequences. (Running on oeis4.)