|
| |
|
|
A038519
|
|
Number of elements of GF(2^n) with trace 0 and subtrace 1.
|
|
3
| |
|
|
1, 0, 1, 3, 2, 10, 16, 28, 72, 120, 256, 528, 992, 2080, 4096, 8128, 16512, 32640, 65536, 131328, 261632, 524800, 1048576, 2096128, 4196352, 8386560, 16777216, 33558528, 67100672, 134225920, 268435456, 536854528, 1073774592
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,4
|
|
|
LINKS
| Robert Munafo, Sequences Related to Floretions
F. Ruskey, Number of irreducible polynomials over GF(2) with given trace and subtrace
F. Ruskey, Number of elements of GF(2^n) of given trace and subtrace
|
|
|
FORMULA
| C(n, r+0)+C(n, r+4)+C(n, r+8)+... where r = 2 if n odd, r = 0 if n even.
G.f. -x*(1+3*x)/((2*x-1)*(2*x^2+2*x+1)) (conjecture) - Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), Apr 29 2005
|
|
|
PROG
| Floretion Algebra Multiplication Program, FAMP Code: tesseq[ - 'i - 'j - 'k - .5i' - .5k' + .5'ii' - 'jj' + .5'kk' + 'ij' - .5'ik' - .5'ji' - .5'jk' - .5'ki' + 'kj']
|
|
|
CROSSREFS
| Cf. A038503, A038505.
Cf. A038518, A038520, A038521.
Sequence in context: A025520 A099946 A011953 * A192617 A082219 A034461
Adjacent sequences: A038516 A038517 A038518 * A038520 A038521 A038522
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Frank Ruskey (ruskey(AT)cs.uvic.ca)
|
| |
|
|
