Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071565
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071565 Numbers n such that x^n + x^(n-1) + x^(n-2) + ... + x + 1 is irreducible over GF(7). +0
1
4, 10, 12, 16, 22, 40, 60, 66, 70, 78, 88, 96, 100, 106, 126, 150, 162, 172, 178, 210, 228, 238, 240, 256, 262, 268, 292, 346, 348, 358, 378, 396, 430, 432, 442, 460, 490, 498, 508, 520, 546, 576, 592, 598, 600, 630, 658, 676, 682, 732, 738, 742, 760, 772 (list; graph; listen)
OFFSET

1,1

MATHEMATICA

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

CROSSREFS

Cf. A071642.

Sequence in context: A117099 A026180 A109274 this_sequence A109096 A079283 A107960

Adjacent sequences: A071562 A071563 A071564 this_sequence A071566 A071567 A071568

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research