login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A206375 Vinogradov's constants arising in enumeration of solutions to Waring's problem in the evil numbers (A001969). 0

%I #18 Feb 11 2020 07:44:56

%S 8,16,32,64,128,256,512,1024,1758,2128,2536,2982,3466,3988,4550,5152,

%T 5792,6474,7194,7956,8758,9600,10484,11408,12376,13384,14432,15524,

%U 16658,17834,19052,20314,21618,22964,24354,25786,27262,28780

%N Vinogradov's constants arising in enumeration of solutions to Waring's problem in the evil numbers (A001969).

%C From Lemma 2, p. 2, of Eminyan.

%H 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 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 a(11) = 2*[(11^2)*(log 11 + log log 11 + 4] = 2*floor((11^2)*(log 11 + log log 11 + 4) = 2*floor[(11^2)*(log 11 + log log 11 + 4)] = 2*floor[879.970885] = 2 * 879 = 1758.

%Y Cf. A001969, A002804.

%K nonn

%O 3,1

%A _Jonathan Vos Post_, Feb 07 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 16:23 EDT 2024. Contains 371989 sequences. (Running on oeis4.)