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.
Table[Binomial[n,FactorInteger[n][[-1,1]]],{n,50}] (* Harvey P. Dale, Feb 25 2015 *)
a(n) = if (n==1, 1, binomial(n, vecmax(factor(n)[,1]))); \\ Michel Marcus, May 06 2020
def a(n):
if n==1: return 1
return binomial(n, factor(n)[-1][0]) # Robin Visser, Nov 25 2023
a[n_] := With[{f = FactorInteger[n]}, Binomial[f[[-1, 1]], f[[1, 1]]]];
Array[a, 100] (* Jean-François Alcover, Dec 02 2021 *)
A080214(n) = if(1==n,n,my(f = factor(n), lpf = f[1, 1], gpf = f[#f~, 1]); binomial(gpf,lpf)); \\ Antti Karttunen, Sep 06 2018
a(4) = 6 because in the fourth row of Pascal's triangle, 1 and 6 are not multiples of 4, and 6 is the largest of those. a(5) = 1 because in the fifth row all the other terms are multiples of 5.
a:= proc(n) local mx, t, i, r;
mx:=1;
t:=n;
for i from 2 to floor(n/2) do
t:= t* (n-i+1)/i;
if irem(t,n)>0 and t>mx then mx:=t fi
od; mx
end;
seq(a(n), n=2..100); # Alois P. Heinz, Jan 22 2011
Table[Max[Select[Table[Binomial[n, m], {m, 0, n}], GCD[#, n] < n &]], {n, 2, 30}]
Comments