|
| |
|
|
A057764
|
|
Triangle T(n,k) = number of nonzero elements of multiplicative order k in Galois field GF(2^n) (n >= 1, 1 <= k <= 2^n-1).
|
|
2
| |
|
|
1, 1, 0, 2, 1, 0, 0, 0, 0, 0, 6, 1, 0, 2, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 30, 1, 0, 2, 0, 0, 0, 6, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 21, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 36
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,4
|
|
|
EXAMPLE
| 1; 1,0,2; 1,0,0,0,0,0,6; ...
|
|
|
PROG
| (MAGMA) {* Order(g) : g in GF(2^6) | g ne 0 *};
|
|
|
CROSSREFS
| Cf. A053287.
Sequence in context: A173677 A037857 A037875 * A010108 A098082 A114448
Adjacent sequences: A057761 A057762 A057763 * A057765 A057766 A057767
|
|
|
KEYWORD
| nonn,easy,nice,tabf
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Nov 01 2000
|
| |
|
|
