Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071566
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071566 Numbers n such that x^n + x^(n-1) + x^(n-2) + ... + x + 1 is irreducible over GF(11). +0
2
2, 12, 16, 22, 28, 30, 40, 46, 58, 66, 70, 72, 100, 102, 108, 148, 162, 172, 178, 196, 222, 232, 250, 276, 280, 292, 330, 366, 372, 382, 418, 442, 460, 462, 466, 486, 498, 556, 568, 586, 592, 598, 600, 612, 618, 642, 646, 672, 676, 682, 700, 718, 760, 768 (list; graph; listen)
OFFSET

1,1

FORMULA

Numbers so far are A019339(n+1) - 1. - Ralf Stephan, Dec 26 2004

MATHEMATICA

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

CROSSREFS

Cf. A071642.

Sequence in context: A107607 A102975 A120300 this_sequence A113802 A057123 A134833

Adjacent sequences: A071563 A071564 A071565 this_sequence A071567 A071568 A071569

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 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research