Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A108346
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A108346 Least positive number a(n) such that P2(2n+1,q) divides Q(a(n),q), where both P2 and Q are polynomials in GF(2) and P2(n,q) is the n-th binary polynomial, i.e., P2(n,q) = Sum[i>=0, b(i)q^i], with n = Sum[i>=0, b(i)2^i]; and Q(m,q) is 1 + q^m. +0
1
1, 1, 2, 3, 3, 7, 7, 4, 4, 15, 6, 7, 15, 6, 7, 5, 5, 21, 31, 14, 31, 15, 12, 31, 21, 8, 15, 31, 14, 31, 31, 6, 6, 63, 14, 31, 9, 28, 31, 15, 14, 21, 8, 21, 31, 63, 15, 30, 63, 10, 21, 63, 28, 12, 63, 31, 31, 63, 21, 12, 15, 31, 30, 7, 7, 127, 93, 60, 127, 15, 62, 127, 127, 62 (list; graph; listen)
OFFSET

0,3

LINKS

J. N. Cooper, D. Eichhorn and K. O'Bryant, Reciprocals of binary power series

CROSSREFS

Cf. A000374.

Adjacent sequences: A108343 A108344 A108345 this_sequence A108347 A108348 A108349

Sequence in context: A140407 A063670 A143444 this_sequence A062761 A117524 A045683

KEYWORD

nonn

AUTHOR

Ralf Stephan, Jul 01 2005

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 October 8 07:38 EDT 2008. Contains 144667 sequences.


AT&T Labs Research