The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A348522 Number of partitions of n into two or more cubes. 2

%I #12 Apr 28 2022 13:35:36

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

%T 6,7,7,7,7,7,8,8,8,9,9,9,9,9,10,10,10,11,11,11,12,12,13,13,13,14,14,

%U 14,15,15,16,17,17,18,18,18,19,19,21,21,21,22,22,22,23,23,25

%N Number of partitions of n into two or more cubes.

%H David A. Corneth, <a href="/A348522/b348522.txt">Table of n, a(n) for n = 0..10000</a>

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

%o (PARI)

%o cubes_less_than(n) = { my(lista=List([]),i=1,k=1); while(k<n, listput(lista,k); i++; k = i^3); Vecrev(Vec(lista)); };

%o partitions_into_with_trailing_ones(n, parts, from=1) = if(!n, 1, if(#parts<=(from+1), if(#parts == from, 1, (1+(n\parts[from]))), my(s=0); for(i=from, #parts, if(parts[i]<=n, s += partitions_into_with_trailing_ones(n-parts[i], parts, i))); (s)));

%o A348522(n) = if(n<2,0,partitions_into_with_trailing_ones(n, cubes_less_than(n))); \\ _Antti Karttunen_, Oct 31 2021

%Y Cf. A000578, A003108, A010057, A219610, A348524.

%K nonn

%O 0,10

%A _Ilya Gutkovskiy_, Oct 21 2021

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 May 21 04:19 EDT 2024. Contains 372720 sequences. (Running on oeis4.)