This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A079673 Consider pairs (r,s) such that the polynomial (x^r+1) divides (x^s+1) and 1 <= r < s. This sequence gives the r values; A079581 gives the s values. 3
 1, 1, 2, 1, 1, 3, 2, 1, 4, 1, 2, 1, 3, 5, 1, 2, 6, 1, 4, 1, 3, 7, 2, 1, 8, 1, 5, 2, 1, 3, 9, 4, 1, 2, 6, 10, 1, 1, 3, 11, 2, 1, 5, 7, 4, 12, 1, 2, 1, 3, 13, 8, 1, 2, 6, 14, 1, 4, 1, 3, 5, 9, 15, 2, 1, 16, 1, 7, 2, 10, 1, 3, 17, 4, 1, 2, 6, 18, 1, 5, 11, 8, 1, 3, 19, 2, 1, 4, 12, 20, 1, 2, 1, 3, 7, 9, 21, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS (x^r+1) divides (x^s+1) iff s/r is an odd integer. LINKS EXAMPLE a(5)=1 and a(6)=3 because A079581(5)=A079581(6)=9 and (x^1+1) and (x^3+1) divide (x^9+1). CROSSREFS Cf. A079581, A079665, A079672. Sequence in context: A025831 A184751 A296150 * A124829 A093394 A094363 Adjacent sequences:  A079670 A079671 A079672 * A079674 A079675 A079676 KEYWORD nonn AUTHOR Jose R. Brox (tautocrona(AT)terra.es), Jan 25 2003 EXTENSIONS Edited by Don Reble, Jun 12 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 8 12:07 EST 2019. Contains 329862 sequences. (Running on oeis4.)