Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071428
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071428 Numbers n such that x^n + x^(n-1) + x^(n-2) + ... + x + 1 is irreducible over GF(3). +0
1
4, 6, 16, 18, 28, 30, 42, 52, 78, 88, 100, 112, 126, 136, 138, 148, 162, 172, 196, 198, 210, 222, 232, 256, 268, 280, 282, 292, 316, 330, 352, 378, 388, 400, 448, 460, 462, 486, 508, 520, 556, 568, 570, 592, 606, 616, 630, 640, 652, 676, 690, 700, 738, 750 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

Do[s = Sum[x^i, {i, 0, n}]; If[ ToString[ Factor[s, Modulus -> 3]] == ToString[s], Print[n]], {n, 0, 800, 2}]

CROSSREFS

Cf. A071642.

Sequence in context: A133092 A056222 A138624 this_sequence A117988 A120542 A132344

Adjacent sequences: A071425 A071426 A071427 this_sequence A071429 A071430 A071431

KEYWORD

easy,nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 22 2002

page 1

Search completed in 0.002 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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research