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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A099244 Greatest common divisor of length of n in binary representation and its number of ones. 6
1, 1, 2, 1, 1, 1, 3, 1, 2, 2, 1, 2, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 2, 2, 3, 2, 3, 3, 2, 2, 3, 3, 2, 3, 2, 2, 1, 2, 3, 3, 2, 3, 2, 2, 1, 3, 2, 2, 1, 2, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

a(n) = GCD(A070939(n), A000120(n));

a(A000225(n)) = n and a(m) < n for m < A000225(n).

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Index entries for sequences related to binary expansion of n

PROG

(Haskell)

a099244 n = gcd (a070939 n) (a000120 n)

-- Reinhard Zumkeller, Oct 10 2013

CROSSREFS

Cf. A099248, A099247, A099249, A099245, A099246, A007088.

Sequence in context: A280688 A285728 A157925 * A260221 A014671 A029365

Adjacent sequences:  A099241 A099242 A099243 * A099245 A099246 A099247

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Oct 08 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 June 24 05:21 EDT 2019. Contains 324318 sequences. (Running on oeis4.)