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.

A371702 a(n) is the least positive k such that Product_{i=1..k} (1 + 1/(2*i-1)) >= n.

This page as a plain text file.
%I A371702 #8 Apr 04 2024 10:27:27
%S A371702 1,1,1,3,5,8,12,16,21,26,32,39,46,54,63,72,82,92,103,115,128,141,154,
%T A371702 169,184,199,215,232,250,268,287,306,326,347,368,390,413,436,460,484,
%U A371702 510,535,562,589,616,645,674,703,734,765,796,828,861,894,928,963
%N A371702 a(n) is the least positive k such that Product_{i=1..k} (1 + 1/(2*i-1)) >= n.
%F A371702 a(n) ~ n^2 / Pi. - _Vaclav Kotesovec_, Apr 03 2024
%e A371702 a(4) = 5: (2/1) * (4/3) * (6/5) * (8/7) * (10/9) = 256 / 63 = 4.063492... > 4.
%t A371702 a[n_] := For[k = 1, True, k++, If[(2 k)!!/(2 k - 1)!! >= n, Return[k]]]; Table[a[n], {n, 0, 55}]
%o A371702 (PARI) a(n) = my(k=1); while (prod(i=1, k, 1 + 1/(2*i-1)) < n, k++); k; \\ _Michel Marcus_, Apr 03 2024
%Y A371702 Cf. A000165, A001147, A001803, A046161, A072986, A371701.
%K A371702 nonn
%O A371702 0,4
%A A371702 _Ilya Gutkovskiy_, Apr 03 2024