login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A092461 Let S_n be the set {n!/(i!*j!*k!) | i, j, k > 0, i+j+k = n} (i.e., trinomial coefficients that involve all three monomials). Then a(n) is the smallest gcd of any three members of S_n. 0

%I

%S 6,12,10,30,7,28,6,30,11,66,13,91,6,12,34,102,19,38,12,22,23,46,15,65,

%T 6,12,29,435,62,124,6,34,10,36,37,703,6,24,41,82,86,43,20,46,47,94,21,

%U 70,6,12,53,159,10,35,21,58,59,177,61,1891,14,28,10,30,67,134,12,14,142,142

%N Let S_n be the set {n!/(i!*j!*k!) | i, j, k > 0, i+j+k = n} (i.e., trinomial coefficients that involve all three monomials). Then a(n) is the smallest gcd of any three members of S_n.

%C Are there any 1's in this sequence?

%e S_7 = {42, 105, 140, 210}, gcd(42, 105, 140) = 7, gcd(42, 105, 210) = 21, gcd(42, 140, 210) = 14, gcd(105, 140, 210) = 35. So a(7) is the smallest of these, 7.

%Y Cf. A046816, A091963.

%K nonn,less

%O 3,1

%A _David Wasserman_, Mar 25 2004

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 19 06:41 EDT 2019. Contains 323386 sequences. (Running on oeis4.)