|
Search: id:A092461
|
|
|
| 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
1
|
|
| 6, 12, 10, 30, 7, 28, 6, 30, 11, 66, 13, 91, 6, 12, 34, 102, 19, 38, 12, 22, 23, 46, 15, 65, 6, 12, 29, 435, 62, 124, 6, 34, 10, 36, 37, 703, 6, 24, 41, 82, 86, 43, 20, 46, 47, 94, 21, 70, 6, 12, 53, 159, 10, 35, 21, 58, 59, 177, 61, 1891, 14, 28, 10, 30, 67, 134, 12, 14, 142, 142
(list; graph; listen)
|
|
|
OFFSET
|
3,1
|
|
|
COMMENT
|
Are there any 1's in this sequence?
|
|
EXAMPLE
|
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.
|
|
CROSSREFS
|
Cf. A091963, A046816.
Sequence in context: A134383 A114797 A048726 this_sequence A102809 A060479 A028998
Adjacent sequences: A092458 A092459 A092460 this_sequence A092462 A092463 A092464
|
|
KEYWORD
|
nonn,less
|
|
AUTHOR
|
David Wasserman (dwasserm(AT)earthlink.net), Mar 25 2004
|
|
|
Search completed in 0.002 seconds
|
