cp's OEIS Frontend

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.

A080213 a(n) = binomial(n, greatest prime factor of n).

This page as a plain text file.
%I A080213 #14 Nov 25 2023 07:08:17
%S A080213 1,1,1,6,1,20,1,28,84,252,1,220,1,3432,3003,120,1,816,1,15504,116280,
%T A080213 705432,1,2024,53130,10400600,2925,1184040,1,142506,1,496,193536720,
%U A080213 2333606220,6724520,7140,1,35345263800,8122425444,658008,1,26978328,1
%N A080213 a(n) = binomial(n, greatest prime factor of n).
%C A080213 For n>1: a(n)=1 iff n is prime.
%H A080213 Robin Visser, <a href="/A080213/b080213.txt">Table of n, a(n) for n = 1..3000</a>
%F A080213 a(n) = binomial(n, A006530(n)). - _Michel Marcus_, May 06 2020
%t A080213 Table[Binomial[n,FactorInteger[n][[-1,1]]],{n,50}] (* _Harvey P. Dale_, Feb 25 2015 *)
%o A080213 (PARI) a(n) = if (n==1, 1, binomial(n, vecmax(factor(n)[,1]))); \\ _Michel Marcus_, May 06 2020
%o A080213 (Sage)
%o A080213 def a(n):
%o A080213     if n==1: return 1
%o A080213     return binomial(n, factor(n)[-1][0])  # _Robin Visser_, Nov 25 2023
%Y A080213 Cf. A006530, A080211, A080212.
%K A080213 nonn
%O A080213 1,4
%A A080213 _Reinhard Zumkeller_, Feb 06 2003