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 A067289 #14 Apr 24 2022 02:29:57 %S A067289 5,7,11,25,33,34,35,38,39,46,51,55,57,58,62,65,81,207,212,236,242,243, %T A067289 244,245,261,268,275,279,284,292,316,325,332,333,338,356,363,369,387, %U A067289 388,404,412,423,425,428,436,729,1065,1066,1070,1074,1085,1086,1090 %N A067289 Numbers k such that the number of divisors of k is floor(prime(k)/k). %H A067289 Amiram Eldar, <a href="/A067289/b067289.txt">Table of n, a(n) for n = 1..10000</a> %F A067289 Numbers k such that A000005(k) = floor(prime(k)/k). %t A067289 Select[Range[1000], DivisorSigma[0, #] == Floor[Prime[#]/#] &] (* _Amiram Eldar_, Apr 23 2022 *) %Y A067289 Cf. A000005, A038605. %K A067289 nonn %O A067289 1,1 %A A067289 _Benoit Cloitre_, Feb 24 2002