id:A057764 - OEIS Search Results

Search: id:A057764

Displaying 1-1 of 1 results found.

page 1

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).

+0
3

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; listen)

	OFFSET	`1,4`
	EXAMPLE	`1; 1,0,2; 1,0,0,0,0,0,6; ...`
	PROGRAM	`(MAGMA) {* Order(g) : g in GF(2^6) \| g ne 0 *};`
	CROSSREFS	`Cf. A053287.` `Sequence in context: A091396 A037857 A037875 this_sequence A010108 A098082 A114448` `Adjacent sequences: A057761 A057762 A057763 this_sequence A057765 A057766 A057767`
	KEYWORD	`nonn,easy,nice,tabf`
	AUTHOR	`njas, Nov 01 2000`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research