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.

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

This page as a plain text file.
%I A186674 #19 Feb 16 2025 08:33:14
%S A186674 0,6,60,632,6135,60132,600115,6000118,60000129,600000127,6000000136
%N A186674 Total number of n-digit numbers requiring 14 positive biquadrates in their representation as sum of biquadrates.
%C A186674 A102831(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) + a(n) + A186676(n) + A186678(n) + A186681(n) + A186683(n) + A186685(n) = A052268(n), for n>1.
%H A186674 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/WaringsProblem.html">Waring's Problem.</a>
%F A186674 a(n) = A186673(n) - A186673(n-1).
%Y A186674 Cf. A046045, A186673.
%K A186674 nonn,base,more
%O A186674 1,2
%A A186674 _Martin Renner_, Feb 25 2011
%E A186674 a(5)-a(11) from _Giovanni Resta_, Apr 29 2016