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.

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

Original entry on oeis.org

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
Offset: 3

Views

Author

Jonathan Vos Post, Feb 07 2012

Keywords

Comments

From Lemma 2, p. 2, of Eminyan.

Examples

			a(11) = 2*floor( 11^2*(log(11) + log(log(11)) + 4) ) = 2*floor(879.970885...) = 2*879 = 1758.
		

Crossrefs

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) ).