A186683 Total number of n-digit numbers requiring 18 positive biquadrates in their representation as sum of biquadrates.

0, 2, 17, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0

Offset: 1

Author

Martin Renner, Feb 25 2011

Keywords

• nonn
• base
• easy

Comments

A161905(n) + A186650(n) + A186652(n) + A186654(n) + A186656(n) + A186658(n) + A186660(n) + A186662(n) + A186664(n) + A186666(n) + A186668(n) + A186670(n) + A186672(n) + A186674(n) + A186676(n) + A186678(n) + A186681(n) + a(n) + A186685(n) = A052268(n)

a(n) = 0 for n >= 5. - Nathaniel Johnston, May 09 2011

Links

• Eric Weisstein's World of Mathematics, Waring's Problem.
• Index entries for linear recurrences with constant coefficients, signature (1).

Crossrefs

Cf. A046049, A099591.

Programs

Mathematica

PadRight[{0, 2, 17, 5}, 100] (* Paolo Xausa, Jul 30 2024 *)

Formula

a(n) = A186682(n) - A186682(n-1).