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
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, 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, 14, 15, 15, 16, 17, 17, 18, 18, 18, 19, 19, 21, 21, 21, 22, 22, 22, 23, 23, 25 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,10
LINKS
PROG
(PARI)
cubes_less_than(n) = { my(lista=List([]), i=1, k=1); while(k<n, listput(lista, k); i++; k = i^3); Vecrev(Vec(lista)); };
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)));
A348522(n) = if(n<2, 0, partitions_into_with_trailing_ones(n, cubes_less_than(n))); \\ Antti Karttunen, Oct 31 2021
CROSSREFS
Sequence in context: A180447 A295866 A115338 * A226046 A133877 A132270
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Oct 21 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 30 08:41 EDT 2024. Contains 372131 sequences. (Running on oeis4.)