|
%I #24 Jan 27 2022 22:13:29
%S 2,5,7,10,12,15,17,20,23,25,28,30,33,35,38,40,43,46,48,51,53,56,58,61,
%T 64,66,69,71,74,76,79,81,84,87,89,92,94,97,99,102,105,107,110,112,115,
%U 117,120,122,125,128,130,133,135,138,140,143,146,148,151,153,156,158,161,163
%N Sequence arising in multiprocessor page migration.
%C a(n) minimizes the maximum of 1+(a(n)+1)/(2*n) and 1+(2*n+(a(n)+1)/2)/a(n). In case that a(n) is not unique and the same maximum occurs more than once, take the smaller value (assuming that this is a counter value on the nodes that is better if it stays small). - _R. J. Mathar_, Oct 26 2017
%C Is this the Beatty sequence b(n) = floor(k*n) with k = (sqrt(17)+1)/2? If not, and there is some n with a(n) != b(n), then a(n) = b(n) + 1 and n > 10^8. - _Charles R Greathouse IV_, Jan 27 2022
%D J. Westbrook, Randomized algorithms for multiprocessor page migration, in "On-Line Algorithms", DIMACS Series in Discrete Math., Vol. 7, 1992, pp. 135-149.
%H J. Westbrook, <a href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.8544">Randomized algorithms for multiprocessor page migration</a>, in "On-Line Algorithms", SIAM J. Comput., 23(5), 951-965. (15 pages), 1994, <a href="https://doi.org/10.1137/S0097539791199796">DOI</a>
%K nonn
%O 1,1
%A _N. J. A. Sloane_
%E Terms beyond n=10 from _R. J. Mathar_, Oct 26 2017
|
