The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”). Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A087291 Number of pairs of polynomials (f,g) in GF(2)[x] satisfying 1 <= deg(f) <= n, 1 <= deg(g) <= n and gcd(f,g) = 1. 3
 0, 2, 18, 98, 450, 1922, 7938, 32258, 130050, 522242, 2093058, 8380418, 33538050, 134184962, 536805378, 2147352578, 8589672450, 34359214082, 137437904898, 549753716738, 2199019061250 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Unpublished result due to Stephen Suen, David desJardins and W. Edwin Clark. This the case k = 2, q = 2 of their formula (q^(n+1)-q)^k*(1-1/(q^(k-1))) for the number of ordered k-tuples (f_1, ..., f_k) of polynomials in GF(q)[x] such that 1 <= deg(f_i) <= n for all i and gcd((f_1, ..., f_k) = 1. LINKS FORMULA a(n) = 2*(2^n-1)^2. G.f.: 2*x*(1+2*x)/((1-x)*(1-2*x)*(1-4*x)). - Colin Barker, Feb 22 2012 EXAMPLE a(1) = 2 since gcd(x,x+1) = 1 and gcd(x+1,x) = 1 and no other pair (f,g) of polynomials in GF(2)[x] of degree 1 satisfy gcd(f,g) = 1. CROSSREFS Cf. A087289, A087290, A087292. Sequence in context: A052638 A127553 A055357 * A267691 A219758 A005969 Adjacent sequences:  A087288 A087289 A087290 * A087292 A087293 A087294 KEYWORD easy,nonn AUTHOR W. Edwin Clark, Aug 29 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 8 02:41 EST 2021. Contains 349590 sequences. (Running on oeis4.)