|
Search: id:A092394
|
|
|
| A092394 |
|
Largest gcd of two distinct numbers on row n of Pascal's triangle. |
|
+0
1
|
|
| 1, 1, 2, 5, 5, 7, 28, 42, 42, 165, 132, 429, 1001, 1001, 1430, 6188, 4862, 25194, 41990, 58786, 58786, 245157, 653752, 742900, 1931540, 4345965, 2674440, 17298645, 9694845, 29464725, 94287120, 129644790, 927983760, 811985790, 477638700
(list; graph; listen)
|
|
|
OFFSET
|
2,3
|
|
|
EXAMPLE
|
For n = 6, the numbers on the row are 1, 6, 15, and 20, and the gcd's of pairs of these are 1, 3, 2, and 5. So a(6) = 5.
|
|
CROSSREFS
|
Cf. A007318, A091963.
Adjacent sequences: A092391 A092392 A092393 this_sequence A092395 A092396 A092397
Sequence in context: A082087 A023850 A101858 this_sequence A027438 A076520 A014249
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
David Wasserman (dwasserm(AT)earthlink.net), Mar 21 2004
|
|
|
Search completed in 0.002 seconds
|
