This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 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
 8, 16, 32, 64, 128, 256, 512, 1024, 1758, 2128, 2536, 2982, 3466, 3988, 4550, 5152, 5792, 6474, 7194, 7956, 8758, 9600, 10484, 11408, 12376, 13384, 14432, 15524, 16658, 17834, 19052, 20314, 21618, 22964, 24354, 25786, 27262, 28780 (list; graph; refs; listen; history; text; internal format)
 OFFSET 3,1 COMMENTS From Lemma 2, p.2, of Eminyan. LINKS K. M. Eminyan, Waring's problem in the natural numbers with binary expansions of a special type, arXiv:1202.1211v1 [math.NT], Feb 06 2012. FORMULA For 3 <= n <= 10 then 2^n; else if n> 10 then a(n) = 2*floor( n^2*(log n + log log n + 4) ). EXAMPLE 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. CROSSREFS Cf. A001969, A002804. Sequence in context: A281016 A048169 A089882 * A146541 A261976 A291124 Adjacent sequences:  A206372 A206373 A206374 * A206376 A206377 A206378 KEYWORD nonn AUTHOR Jonathan Vos Post, Feb 07 2012 STATUS approved

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

Last modified January 17 19:58 EST 2019. Contains 319251 sequences. (Running on oeis4.)