login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A099548 Odd part of n modulo 7. 7
1, 1, 3, 1, 5, 3, 0, 1, 2, 5, 4, 3, 6, 0, 1, 1, 3, 2, 5, 5, 0, 4, 2, 3, 4, 6, 6, 0, 1, 1, 3, 1, 5, 3, 0, 2, 2, 5, 4, 5, 6, 0, 1, 4, 3, 2, 5, 3, 0, 4, 2, 6, 4, 6, 6, 0, 1, 1, 3, 1, 5, 3, 0, 1, 2, 5, 4, 3, 6, 0, 1, 2, 3, 2, 5, 5, 0, 4, 2, 5, 4, 6, 6, 0, 1, 1, 3, 4, 5, 3, 0, 2, 2, 5, 4, 3, 6, 0, 1, 4, 3, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Table of n, a(n) for n=1..102.

PROG

(PARI) (n>>valuation(n, 2))%7 \\Charles R Greathouse IV, May 14 2014

CROSSREFS

Equals A010876( A000265(n) ).

Cf. A099544, A099545, A099546, A099547, A099549, A099550, A099551.

Sequence in context: A249139 A059971 A184343 * A134743 A099547 A137758

Adjacent sequences:  A099545 A099546 A099547 * A099549 A099550 A099551

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 10:45 EDT 2019. Contains 322424 sequences. (Running on oeis4.)