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.

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

This page as a plain text file.
%I A186680 #31 Feb 21 2025 22:41:26
%S A186680 0,3,33,63,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,
%T A186680 65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,
%U A186680 65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65,65
%N A186680 Total number of positive integers below 10^n requiring 17 positive biquadrates in their representation as sum of biquadrates.
%C A186680 A114322(n) + A186649(n) + A186651(n) + A186653(n) + A186655(n) + A186657(n) + A186659(n) + A186661(n) + A186663(n) + A186665(n) + A186667(n) + A186669(n) + A186671(n) + A186673(n) + A186675(n) + A186677(n) + a(n) + A186682(n) + A186684(n) = A002283(n)
%C A186680 a(n) = 65 for n >= 5. - _Nathaniel Johnston_, May 09 2011
%C A186680 Continued fraction expansion of (826055+sqrt(4229))/2503382. - _Bruno Berselli_, May 10 2011
%H A186680 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/WaringsProblem.html">Waring's Problem</a>.
%H A186680 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (1).
%F A186680 G.f.: x^2*(3+30*x+30*x^2+2*x^3)/(1-x). - _Bruno Berselli_, May 10 2011
%t A186680 PadRight[{0, 3, 33, 63}, 100, 65] (* _Paolo Xausa_, Jul 31 2024 *)
%Y A186680 Cf. A046048, A099591.
%K A186680 nonn,easy
%O A186680 1,2
%A A186680 _Martin Renner_, Feb 25 2011
%E A186680 a(5)-a(6) from _Lars Blomberg_, May 08 2011
%E A186680 a(7) from _Charles R Greathouse IV_, May 08 2011
%E A186680 Terms after a(7) from _Nathaniel Johnston_, May 09 2011