|
|
|
|
| A356583
|
|
T(n,k) is the number of degree n polynomials p in GF_2[x] whose squarefree part has degree k, n >= 0, 0 <= k <= n. Triangular array read by rows.
(history;
published version)
|
|
|
|
|
#17 by N. J. A. Sloane at Tue Aug 23 10:20:53 EDT 2022
|
|
|
|
|
|
|
|
#16 by Hugo Pfoertner at Mon Aug 15 10:38:45 EDT 2022
|
|
|
|
|
|
|
|
#15 by Hugo Pfoertner at Mon Aug 15 10:38:05 EDT 2022
|
|
| NAME
|
T(n,k) is the number of degree n polynomials p in GF_2[x] whose square freesquarefree part has degree k, n >= 0, 0 <= k <= n. Triangular array read by rows.
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#14 by Joerg Arndt at Sun Aug 14 02:34:41 EDT 2022
|
|
|
|
|
|
|
|
#13 by Joerg Arndt at Sun Aug 14 02:34:18 EDT 2022
|
|
| NAME
|
T(n,k) is the number of degree n polynomials p in GF_2[x] such that thewhose square free part of p has degree k, n >= 0, 0 <= k <= n. Triangular array read by rows.
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#12 by Stefano Spezia at Sat Aug 13 12:09:16 EDT 2022
|
|
|
|
|
|
|
|
#11 by Stefano Spezia at Sat Aug 13 12:09:13 EDT 2022
|
|
| CROSSREFS
|
Cf. A001037.
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#10 by Michel Marcus at Sat Aug 13 11:23:51 EDT 2022
|
|
|
|
|
|
|
|
#9 by Michel Marcus at Sat Aug 13 11:23:47 EDT 2022
|
|
| NAME
|
Triangular array read by rows. T(n,k) is the number of degree n polynomials p in GF_2[x] such that the square free part of p has degree k, n >= 0, 0 <= k <= n. Triangular array read by rows.
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#8 by Jon E. Schoenfield at Sat Aug 13 11:02:36 EDT 2022
|
|
|
|
|
|
|
