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.

A103591 Smallest number m such that Sum_{k=1..m} 1/prime(k) >= n/2.

This page as a plain text file.
%I A103591 #17 Mar 27 2019 19:07:32
%S A103591 1,3,10,59,1413,361139,4833601540,43922730588128390
%N A103591 Smallest number m such that Sum_{k=1..m} 1/prime(k) >= n/2.
%F A103591 a(2n) = A046024(n). - _Michel Marcus_, Aug 22 2013
%t A103591 Table[m = 1; s = 0; While[(s = s + 1/Prime[m]) < n/2, m++];
%t A103591 m, {n, 1, 5}] (* _Robert Price_, Mar 27 2019 *)
%o A103591 (PARI) a(n) = my(s = 0, k = 1); while ((s += 1/prime(k)) < n/2, k++); k \\ _Michel Marcus_, Aug 22 2013
%Y A103591 Cf. A016088, A046024, A103592-A103600.
%K A103591 nonn,more
%O A103591 1,2
%A A103591 _James R. Buddenhagen_, Mar 28 2005
%E A103591 a(7) from _Robert Price_, Dec 10 2013
%E A103591 a(8) derived from A046024 by _Robert Price_, Dec 10 2013