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.
%I A006167 M2349 #26 Nov 03 2017 22:18:25
%S A006167 1,3,4,8,11,20,27,45,61,95,128,193,257,374,497,703,927,1287,1683,2297,
%T A006167 2987,4013,5186,6887,8843,11614,14836,19294,24514,31622,39968,51167,
%U A006167 64377,81839,102509,129528,161539,202959,252124,315110,389949,485062
%N A006167 Number of factorization patterns of polynomials of degree n over F_2.
%C A006167 Let F_q(n) represent the number of factorization patterns of n with the property that there exists a monic polynomial V of degree n over the finite field F_q such that V factors over F_q into one of the F_q(n) factorization patterns. Sequence is for the q=2 case,
%D A006167 R. A. Hultquist, G. L. Mullen and H. Niederreiter, Association schemes and derived PBIB designs of prime power order, Ars. Combin., 25 (1988), 65-82.
%D A006167 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H A006167 T. D. Noe, <a href="/A006167/b006167.txt">Table of n, a(n) for n=1..1000</a>
%H A006167 A. K. Agarwal and G. L. Mullen, <a href="http://dx.doi.org/10.1016/0097-3165(88)90079-9">Partitions with "d(a) copies of a"</a>, J. Combin. Theory, A48 (1988), 120-135.
%H A006167 R. A. Hultquist, G. L. Mullen and H. Niederreiter, <a href="/A006167/a006167.pdf">Association schemes and derived PBIB designs of prime power order</a>, Ars. Combin., 25 (1988), 65-82. (Annotated scanned copy)
%F A006167 Euler transform of sequence b(n) = sum_{d|n, A001037(d)>=n/d} 1. - _Franklin T. Adams-Watters_, Jun 19 2006
%e A006167 For n=3 there are 5 factorization patterns of cubic polynomials: 3, 2 + 1, 1^3, 1^2 + 1, 1 + 1 + 1. For example 1^2 + 1 corresponds to a cubic polynomial which factors as a linear of multiplicity 2 and a second distinct linear factor. For q=2 the pattern 1 + 1 + 1 is not allowed since over F_2 there are only two distinct monic irreducibles of degree 1. Thus a(3) = 4.
%t A006167 A001037[n_] := Sum[ MoebiusMu[n/d]*2^d, {d, Divisors[n]}]/n; b[n_] := Sum[ nd = A001037[d]; If[nd >= n/d, 1, 0], {d, Divisors[n]}]; EulerTransform[ seq_List ] := With[{m = Length[seq]}, CoefficientList[ Series[ Times @@ (1/(1 - x^Range[m])^seq), {x, 0, m}], x]]; A006167 = Rest[ EulerTransform[ Table[ b[n], {n, 1, 42}]]] (* _Jean-François Alcover_, Mar 15 2012, after _Franklin T. Adams-Watters_ *)
%Y A006167 Cf. A006168, A006169, A006170, A006171.
%Y A006167 Cf. A001037.
%K A006167 nonn,nice
%O A006167 1,2
%A A006167 _N. J. A. Sloane_
%E A006167 Additional comments from Gary Mullen, Jun 03 2003
%E A006167 More terms from _Franklin T. Adams-Watters_, Jun 19 2006