cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A087292 Number of pairs of polynomials (f,g) in GF(3)[x] satisfying 1 <= deg(f) < =n, 1 <= deg(g) <= n and gcd(f,g) = 1.

Table of values

n a(n)
0 0
1 24
2 384
3 4056
4 38400
5 351384
6 3179904
7 28671576
8 258201600
9 2324286744
10 20919997824
11 188284231896
12 1694570841600
13 15251175838104
14 137260697334144
15 1235346620381016
16 11118120616550400
17 100063088648317464
18 900567807132948864
19 8105110292090814936

List of values

[0, 24, 384, 4056, 38400, 351384, 3179904, 28671576, 258201600, 2324286744, 20919997824, 188284231896, 1694570841600, 15251175838104, 137260697334144, 1235346620381016, 11118120616550400, 100063088648317464, 900567807132948864, 8105110292090814936]