The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A099549 Odd part of n modulo 8. 7
 1, 1, 3, 1, 5, 3, 7, 1, 1, 5, 3, 3, 5, 7, 7, 1, 1, 1, 3, 5, 5, 3, 7, 3, 1, 5, 3, 7, 5, 7, 7, 1, 1, 1, 3, 1, 5, 3, 7, 5, 1, 5, 3, 3, 5, 7, 7, 3, 1, 1, 3, 5, 5, 3, 7, 7, 1, 5, 3, 7, 5, 7, 7, 1, 1, 1, 3, 1, 5, 3, 7, 1, 1, 5, 3, 3, 5, 7, 7, 5, 1, 1, 3, 5, 5, 3, 7, 3, 1, 5, 3, 7, 5, 7, 7, 3, 1, 1, 3, 1, 5, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS PROG (PARI) (n>>valuation(n, 2))%8 \\Charles R Greathouse IV, May 14 2014 CROSSREFS Equals A010877( A000265(n) ). Cf. A099544, A099545, A099546, A099547, A099548, A099550, A099551. Sequence in context: A127418 A099550 A349341 * A334212 A082725 A308655 Adjacent sequences:  A099546 A099547 A099548 * A099550 A099551 A099552 KEYWORD nonn,easy AUTHOR Ralf Stephan, Oct 23 2004 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 3 05:05 EST 2021. Contains 349445 sequences. (Running on oeis4.)