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.

A260795 Number of steps required by the Hwang-Deutsch merging algorithm.

This page as a plain text file.
%I A260795 #16 May 11 2024 09:11:44
%S A260795 2,3,5,8,12,17,25,36,52,73,105,148,212,297,425,596,852,1193,1705,2388,
%T A260795 3412,4777,6825,95556,13652,19113,27305,38228,54612,76457,109225,
%U A260795 152916,218452,305833,436905,611668,873812,1223337,1747625,2446676,3495252,4893353,6990505
%N A260795 Number of steps required by the Hwang-Deutsch merging algorithm.
%H A260795 Amiram Eldar, <a href="/A260795/b260795.txt">Table of n, a(n) for n = 3..57</a>
%H A260795 Frank K. Hwang and David N. Deutsch, <a href="http://dx.doi.org/10.1145/321738.321749">A class of merging algorithms</a>, Journal of the ACM (JACM) 20.1 (1973): 148-159. See "R" page 157.
%Y A260795 Cf. A260794, A200310, A260996, A260997.
%K A260795 nonn
%O A260795 3,1
%A A260795 _N. J. A. Sloane_, Aug 06 2015
%E A260795 More terms from _Amiram Eldar_, May 11 2024