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.

A186669 Total number of positive integers below 10^n requiring 12 positive biquadrates in their representation as sum of biquadrates.

This page as a plain text file.
%I A186669 #20 Feb 16 2025 08:33:14
%S A186669 0,6,68,724,7126,67537,667927,6668357,66668807,666669258,6666669682
%N A186669 Total number of positive integers below 10^n requiring 12 positive biquadrates in their representation as sum of biquadrates.
%C A186669 A114322(n) + A186649(n) + A186651(n) + A186653(n) + A186655(n) + A186657(n) + A186659(n) + A186661(n) + A186663(n) + A186665(n) + A186667(n) + a(n) + A186671(n) + A186673(n) + A186675(n) + A186677(n) + A186680(n) + A186682(n) + A186684(n) = A002283(n).
%H A186669 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/WaringsProblem.html">Waring's Problem.</a>
%Y A186669 Cf. A003346, A186670.
%K A186669 nonn,more
%O A186669 1,2
%A A186669 _Martin Renner_, Feb 25 2011
%E A186669 a(5)-a(7) from _Lars Blomberg_, May 08 2011
%E A186669 a(8)-a(9) from _Hiroaki Yamanouchi_, Oct 13 2014
%E A186669 a(10)-a(11) from _Giovanni Resta_, Apr 29 2016