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 A080211 #17 Nov 25 2023 07:29:34
%S A080211 1,1,1,6,1,15,1,28,84,45,1,66,1,91,455,120,1,153,1,190,1330,231,1,276,
%T A080211 53130,325,2925,378,1,435,1,496,5456,561,324632,630,1,703,9139,780,1,
%U A080211 861,1,946,14190,1035,1,1128,85900584,1225,20825,1326,1,1431,3478761
%N A080211 a(n) = binomial(n, smallest prime factor of n).
%C A080211 For n>1: a(n)=1 iff n is prime.
%H A080211 Robin Visser, <a href="/A080211/b080211.txt">Table of n, a(n) for n = 1..10000</a>
%F A080211 a(n) = binomial(n, A020639(n)). - _Michel Marcus_, May 06 2020
%t A080211 Table[Binomial[n,FactorInteger[n][[1,1]]],{n,60}] (* _Harvey P. Dale_, Apr 12 2011 *)
%o A080211 (PARI) a(n) = if (n==1, 1, binomial(n, vecmin(factor(n)[,1]))); \\ _Michel Marcus_, May 06 2020
%o A080211 (Sage)
%o A080211 def a(n):
%o A080211 if n==1: return 1
%o A080211 return binomial(n, factor(n)[0][0]) # _Robin Visser_, Nov 25 2023
%Y A080211 Cf. A020639, A080212, A080213.
%K A080211 nonn
%O A080211 1,4
%A A080211 _Reinhard Zumkeller_, Feb 06 2003