# “Number of Decompositions into $k$ Powers of $p$”-Counting Functions

Let $a_j\in \mathbb{N}$, with $0< a_{j-1}<a_j$. My question is:

What is known about the counting functions $\sigma_{k,p}(n)$, counting how many numbers, less than $n$, have a decomposition into a sum of $k$ $p$-powers of $a_j$?

So for every $x\le n$, I ask, how many ways there are to decompose $x$ like $$x=\sum_{j=1}^{k} a_j^p,$$ and then sum these (ways) up, e.g. $30$ has a unique decomposition into $1^2+2^2+3^2+4^2$, $90$ has 2 ($1^2+2^2+6^2+7^2$ and $1^2+3^2+4^2+8^2$), $78$ has 3 (see here) and so forth...

Below you'll find some plots, where I summed up $4$ squares with $\max a_j=300$ and $4$ cubes with $\max a_j=200$.

They show a quite different behaviour, concerning their curvature, but I'm not sure if this is an artifact of the sample I have taken.

EDIT: The linear appearance of the lower left cube-plot might be related to the fact that even if $a_j=a_k$ is allowed (Waring's problem) $9$ cubes are needed to represent all numbers. So does the curvature related to the number of $p$ powers I add up?

-

– draks ... Apr 5 '12 at 21:49
– draks ... Apr 5 '12 at 22:19
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 24, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9528725743293762, "perplexity_flag": "head"}