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 A072916 #13 Nov 04 2024 21:48:19
%S A072916 3,8,19,41,117,254,616,1642,3766,9461,24183,60252,151368,385600,
%T A072916 979844,2507393,6428977,16513542,42642649,110283280,285776799,
%U A072916 742428731,1932223170,5038580446,13159683245,34423463648,90173540312
%N A072916 Number of m such that floor(prime(m)/m) = n.
%e A072916 Only m = 2,3,4 give [p(m)/m] = 1, so a(1) = 3.
%e A072916 There are 8 values of m giving floor(prime(m)/m) = 2, namely m = 1,5,6,7,8,9,10,11, so a(2) = 8.
%t A072916 a(n_) := Length[Cases[Table[Floor[Prime[m]/m], {m, 1, 1000000}], n]]
%Y A072916 Cf. A062742, A102281.
%K A072916 nonn
%O A072916 1,1
%A A072916 _Zak Seidov_ Aug 11 2002
%E A072916 a(16)-a(27) from _Farideh Firoozbakht_, Sep 13 2005
%E A072916 Typo corrected by _David W. Wilson_, Oct 22 2005