The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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) ).
Sequence in context: A036431 A029407 A259285 * A036414 A234954 A321201
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 25 17:29 EDT 2024. Contains 372804 sequences. (Running on oeis4.)