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.
%I A206375 #23 Oct 25 2024 06:48:56 %S A206375 8,16,32,64,128,256,512,1024,1758,2128,2536,2982,3466,3988,4550,5152, %T A206375 5792,6474,7194,7956,8758,9600,10484,11408,12376,13384,14432,15524, %U A206375 16658,17834,19052,20314,21618,22964,24354,25786,27262,28780 %N A206375 Vinogradov's constants arising in enumeration of solutions to Waring's problem in the evil numbers (A001969). %C A206375 From Lemma 2, p. 2, of Eminyan. %H A206375 K. M. Eminyan, <a href="http://arxiv.org/abs/1202.1211">Waring's problem in the natural numbers with binary expansions of a special type</a>, arXiv:1202.1211v1 [math.NT], Feb 06 2012. %F A206375 For 3 <= n <= 10 then 2^n; else if n > 10 then a(n) = 2*floor( n^2*(log(n) + log(log(n)) + 4) ). %e A206375 a(11) = 2*floor( 11^2*(log(11) + log(log(11)) + 4) ) = 2*floor(879.970885...) = 2*879 = 1758. %Y A206375 Cf. A001969, A002804. %K A206375 nonn %O A206375 3,1 %A A206375 _Jonathan Vos Post_, Feb 07 2012