login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080215 Binomial(greatest prime factor of n, smallest odd prime factor of n). 2
1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 10, 2, 1, 1, 1, 1, 35, 1, 1, 1, 1, 1, 1, 1, 1, 10, 1, 2, 165, 1, 21, 1, 1, 1, 286, 1, 1, 35, 1, 1, 10, 1, 1, 1, 1, 1, 680, 1, 1, 1, 462, 1, 969, 1, 1, 10, 1, 1, 35, 2, 1287, 165, 1, 1, 1771, 21, 1, 1, 1, 1, 10, 1, 330, 286, 1, 1, 1, 1, 1, 35 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = binomial(A006530(n), A078701(n)). - Antti Karttunen, Dec 23 2018
MATHEMATICA
a[n_] := With[{f = Select[FactorInteger[n], #[[1]] != 2&]}, If[f == {}, 2, Binomial[f[[-1, 1]], f[[1, 1]]]]];
Array[a, 100] (* Jean-François Alcover, Dec 02 2021 *)
PROG
(PARI) A080215(n) = if(1==n, n, my(f = factor(n)[, 1], v = select(x->((x%2)==1), f)); binomial(f[#f], if(#v, vecmin(v), 1))); \\ Antti Karttunen, Dec 23 2018
CROSSREFS
Sequence in context: A286299 A081729 A219157 * A266871 A331290 A060500
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Feb 06 2003
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 30 16:34 EDT 2024. Contains 375545 sequences. (Running on oeis4.)