cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A186652 #17 Feb 16 2025 08:33:14
%S A186652 1,5,23,112,648,3564,19820,110506,622268,3501263,19699896
%N A186652 Total number of n-digit numbers requiring 3 positive biquadrates in their representation as sum of biquadrates.
%C A186652 A102831(n) + A186650(n) + a(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) + A186683(n) + A186685(n) = A052268(n), for n>1.
%H A186652 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/WaringsProblem.html">Waring's Problem.</a>
%F A186652 a(n) = A186651(n) - A186651(n-1).
%Y A186652 Cf. A003337, A186651.
%K A186652 nonn,base,more
%O A186652 1,2
%A A186652 _Martin Renner_, Feb 25 2011
%E A186652 a(5)-a(11) from _Giovanni Resta_, Apr 29 2016