Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A123399
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A123399 Orders of "Gray" fields. +0
1
1, 2, 3, 5, 6, 9, 11, 14, 23, 26, 29, 30, 33, 35, 39, 41, 51, 53, 65, 69, 74, 81, 83, 86, 89, 90, 95 (list; graph; listen)
OFFSET

1,2

REFERENCES

D. E. Knuth, TAOCP, Section 7.2.1.1, Problem 31.

FORMULA

Let c_1(x) = x+1, c_2(x) = x^2+x+1, c_{j+1}(x) = x*c_j(x) + c_{j-1}(x) be polynomials over GF(2). Then n is in the sequence iff c_n(x) is a primitive irreducible polynomial.

CROSSREFS

Adjacent sequences: A123396 A123397 A123398 this_sequence A123400 A123401 A123402

Sequence in context: A008747 A054639 A070757 this_sequence A104738 A028309 A026810

KEYWORD

nonn,more

AUTHOR

njas, Oct 15 2006

page 1

Search completed in 0.003 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 11 09:12 EDT 2008. Contains 144832 sequences.


AT&T Labs Research