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

 

Logo

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!)
A083199 Exponent of largest power of 2 dividing A061419(n). 0
0, 1, 0, 0, 3, 2, 1, 0, 0, 1, 0, 2, 1, 0, 0, 1, 0, 1, 0, 2, 1, 0, 0, 1, 0, 2, 1, 0, 1, 0, 5, 4, 3, 2, 1, 0, 0, 1, 0, 7, 6, 5, 4, 3, 2, 1, 0, 1, 0, 0, 0, 0, 0, 2, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 2, 1, 0, 2, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 5, 4, 3, 2, 1, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

LINKS

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

PROG

(PARI) p=1; for(n=1, 100, p=p+ceil(p/2); print1(valuation(p, 2)", "))

CROSSREFS

Sequence in context: A333437 A058257 A330959 * A327187 A274537 A305234

Adjacent sequences:  A083196 A083197 A083198 * A083200 A083201 A083202

KEYWORD

nonn,easy

AUTHOR

Ralf Stephan, Jun 01 2003

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 November 30 20:17 EST 2021. Contains 349425 sequences. (Running on oeis4.)