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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A099546 Odd part of n modulo 5. 7
 1, 1, 3, 1, 0, 3, 2, 1, 4, 0, 1, 3, 3, 2, 0, 1, 2, 4, 4, 0, 1, 1, 3, 3, 0, 3, 2, 2, 4, 0, 1, 1, 3, 2, 0, 4, 2, 4, 4, 0, 1, 1, 3, 1, 0, 3, 2, 3, 4, 0, 1, 3, 3, 2, 0, 2, 2, 4, 4, 0, 1, 1, 3, 1, 0, 3, 2, 2, 4, 0, 1, 4, 3, 2, 0, 4, 2, 4, 4, 0, 1, 1, 3, 1, 0, 3, 2, 1, 4, 0, 1, 3, 3, 2, 0, 3, 2, 4, 4, 0, 1, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS PROG (PARI) (n>>valuation(n, 2))%5 \\Charles R Greathouse IV, May 14 2014 CROSSREFS Equals A010874( A000265(n) ). Cf. A099544, A099545, A099547, A099548, A099549, A099550, A099551. Sequence in context: A160019 A265605 A035629 * A036870 A036874 A256759 Adjacent sequences:  A099543 A099544 A099545 * A099547 A099548 A099549 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 May 26 00:08 EDT 2020. Contains 334613 sequences. (Running on oeis4.)