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!)
 A099544 Odd part of n modulo 3. 7
 1, 1, 0, 1, 2, 0, 1, 1, 0, 2, 2, 0, 1, 1, 0, 1, 2, 0, 1, 2, 0, 2, 2, 0, 1, 1, 0, 1, 2, 0, 1, 1, 0, 2, 2, 0, 1, 1, 0, 2, 2, 0, 1, 2, 0, 2, 2, 0, 1, 1, 0, 1, 2, 0, 1, 1, 0, 2, 2, 0, 1, 1, 0, 1, 2, 0, 1, 2, 0, 2, 2, 0, 1, 1, 0, 1, 2, 0, 1, 2, 0, 2, 2, 0, 1, 1, 0, 2, 2, 0, 1, 2, 0, 2, 2, 0, 1, 1, 0, 1, 2, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 COMMENTS Zero if multiple of 3, one if of form 2^j(3k+1) with 3k+1 odd, two otherwise. LINKS PROG (PARI) (n>>valuation(n, 2))%3 \\ Charles R Greathouse IV, May 14 2014 CROSSREFS Equals A010872( A000265(n) ). Cf. A099545, A099546, A099547, A099548, A099549, A099550, A099551. Sequence in context: A036431 A029407 A259285 * A036414 A234954 A321201 Adjacent sequences:  A099541 A099542 A099543 * A099545 A099546 A099547 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 02:56 EDT 2020. Contains 334613 sequences. (Running on oeis4.)