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 A048839 #21 May 23 2024 04:28:52 %S A048839 2,3,5,6,7,10,11,13,14,15,17,19,20,21,22,23,26,28,29,30,31,33,34,35, %T A048839 37,38,39,40,41,42,43,44,46,47,51,52,53,55,56,57,58,59,60,61,62,63,65, %U A048839 66,67,68,69,70,71,73,74,76,77,78,79,82,83,84,85,86,87,88,89,91,92,93,94 %N A048839 Numbers k dividing P(k)!, where P(k) is the largest prime factor of k. %C A048839 Solutions to Diophantine equation P(k) = K(k), where P(k) is the largest prime which divides k and K(k) is the Kempner function A002034. %D A048839 P. Erdős and C. Ashbacher, Thoughts of Pal Erdos on Some Smarandache Notions, Smarandache Notions Journal, Vol. 8, No. 1-2-3, 1997, 220-224. %H A048839 Amiram Eldar, <a href="/A048839/b048839.txt">Table of n, a(n) for n = 1..10000</a> %F A048839 a(n) ~ n. - _Charles R Greathouse IV_, Sep 20 2012 %t A048839 Select[Range[2, 100], Divisible[FactorInteger[#][[-1, 1]]!, #] &] (* _Amiram Eldar_, May 23 2024 *) %o A048839 (PARI) is(n)=my(s=factor(n)[, 1]); s[#s]!%n==0 \\ _Charles R Greathouse IV_, Sep 20 2012 %Y A048839 Complement is A057109. %Y A048839 Cf. A002034, A102068. %K A048839 nonn,easy %O A048839 1,1 %A A048839 Charles T. Le (charlestle(AT)yahoo.com) %E A048839 Corrected and extended by _Naohiro Nomoto_, Jul 14 2001