|
| |
|
|
A087290
|
|
Number of pairs of polynomials (f,g) in GF(3)[x] satisfying deg(f) <=n, deg(g) <= n and gcd(f,g) = 1.
|
|
3
| |
|
|
8, 56, 488, 4376, 39368, 354296, 3188648, 28697816, 258280328, 2324522936, 20920706408, 188286357656, 1694577218888, 15251194969976, 137260754729768, 1235346792567896
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| An unpublished result due to Stephen Suen, David desJardin and W. Edwin Clark. This the case k = 2, q = 3 of their formula q^((n+1)*k) * (1 - 1/q^(k-1) + (q-1)/q^((n+1)*k)) for the number of ordered k-tuples (f_1, ..., f_k) of polynomials in GF(q)[x] such that deg(f_i) <= n for all i and gcd((f_1, ..., f_k) = 1
|
|
|
FORMULA
| a(n) = 2*3^(2*n+1) + 2
|
|
|
EXAMPLE
| a(0) = 8 since there are eight pairs, (0,1), (0,2), (1,0), (1,1), (1,2), (2,0), (2,1), (2,2) of polynomials (f,g) in GF(3)[x] of degree at most 0 such that gcd(f,g) = 1.
|
|
|
CROSSREFS
| Cf. A087289, A087291, A087292.
Sequence in context: A027081 A093134 A001398 * A086787 A098914 A009107
Adjacent sequences: A087287 A087288 A087289 * A087291 A087292 A087293
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| W. Edwin Clark (eclark(AT)math.usf.edu), Aug 29 2003
|
| |
|
|
