Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079581
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A079581
%S A079581 3,5,6,7,9,9,10,11,12,13,14,15,15,15,17,18,18,19,20,21,21,21,22,23,24,
%T A079581 25,25,26,27,27,27,28,29,30,30,30,31,33,33,33,34,35,35,35,36,36,37,38,
%U A079581 39,39,39,40,41,42,42,42,43,44,45,45,45,45,45,46,47,48,49,49,50,50,51
%N A079581 Consider pairs (r,s) such that the polynomial (x^r+1) divides (x^s+1) 
               and 1 <= r < s. This sequence gives the s values; A079673 gives the 
               r values.
%C A079581 (x^r+1) divides (x^s+1) iff s/r is an odd integer.
%e A079581 9 is in the sequence twice because (x^1+1) and (x^3+1) divide (x^9+1).
%Y A079581 Cf. A079665, A079672, A079673.
%Y A079581 Sequence in context: A047583 A010906 A114309 this_sequence A057716 A138591 
               A136492
%Y A079581 Adjacent sequences: A079578 A079579 A079580 this_sequence A079582 A079583 
               A079584
%K A079581 nonn
%O A079581 1,1
%A A079581 Jose R. Brox (tautocrona(AT)terra.es), Jan 25 2003
%E A079581 Edited by Don Reble (djr(AT)nk.ca), Jun 12 2003

    
page 1

Search completed in 0.001 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 December 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research