prime counts a_1..a_6: [3, 24, 191, 1428, 10968, 84760] (all a_n, n<=40, are non-negative integers)
integer counts N(n) = 3(9^n - 1)/8 exactly for n <= 25: [3, 30, 273, 2460]
functional equation residuals: [2.220446049250313e-16, 2.7755575615628914e-16, 2.2887833992611187e-16]
roots 5.3028, 1.6972; prime error exponent log(w1)/log(q) = 0.7592 > 1/2
deletion counts pi_9(n) - a_n, n = 1..6: [6, 12, 49, 192, 840, 3680] (all >= 0 for n <= 40): a deletion system inside F_9[t]
