Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A091229
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A091229 Smallest k such that n+k is irreducible when interpreted as GF(2)[X]-polynomial. +0
2
2, 1, 0, 0, 3, 2, 1, 0, 3, 2, 1, 0, 1, 0, 5, 4, 3, 2, 1, 0, 5, 4, 3, 2, 1, 0, 5, 4, 3, 2, 1, 0, 5, 4, 3, 2, 1, 0, 3, 2, 1, 0, 5, 4, 3, 2, 1, 0, 7, 6, 5, 4, 3, 2, 1, 0, 3, 2, 1, 0, 1, 0, 5, 4, 3, 2, 1, 0, 5, 4, 3, 2, 1, 0, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0, 3, 2, 1, 0, 5, 4, 3, 2, 1, 0, 5, 4 (list; graph; listen)
OFFSET

0,1

COMMENT

Analogous to A007920.

LINKS

A. Karttunen, Scheme-program for computing this sequence.

Index entries for sequences operating on GF(2)[X]-polynomials

FORMULA

a(n) = A091228(n) - n.

CROSSREFS

Sequence in context: A130507 A037872 A037854 this_sequence A055334 A106237 A071675

Adjacent sequences: A091226 A091227 A091228 this_sequence A091230 A091231 A091232

KEYWORD

nonn

AUTHOR

Antti Karttunen (His-Firstname.His-Surname(AT)iki.fi), Jan 03 2004

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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research