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.
%I A079416 #16 Sep 08 2022 08:45:08 %S A079416 2,2,2,2,2,2,2,2,3,3,3,3,3,3,3,3,3,3,4,4,3,4,4,4,4,4,4,4,4,4,4,4,4,4, %T A079416 4,4,4,4,4,4,4,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5, %U A079416 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5 %N A079416 a(n) = round(prime(n)/n). %C A079416 The sequence is not monotone, see example and A079417. %H A079416 G. C. Greubel, <a href="/A079416/b079416.txt">Table of n, a(n) for n = 1..10000</a> %e A079416 a(20) = round(prime(20)/20) = round(71/20) = round(3.55) = 4; %e A079416 a(21) = round(prime(21)/21) = round(73/21) = round(3.476190...) = 3; %e A079416 a(22) = round(prime(22)/22) = round(79/22) = round(3.590909...) = 4. %t A079416 f[n_] := Round[ Prime[n]/n]; Array[f, 105] (* _Robert G. Wilson v_, Oct 23 2015 *) %o A079416 (PARI) vector(100, n, round(prime(n)/n)) \\ _G. C. Greubel_, Jan 18 2019 %o A079416 (Magma) [Round(NthPrime(n)/n): n in [1..100]]; // _G. C. Greubel_, Jan 18 2019 %o A079416 (Sage) [round(nth_prime(n)/n) for n in (1..100)] # _G. C. Greubel_, Jan 18 2019 %Y A079416 Cf. A079418, A000040, A038605, A107609, A263076. %K A079416 nonn %O A079416 1,1 %A A079416 _Reinhard Zumkeller_, Jan 07 2003