id:A099244 - OEIS Search Results

Search: id:A099244

Displaying 1-1 of 1 results found.

page 1

Greatest common divisor of length of n in binary representation and its number of ones.

+0
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; listen)

	OFFSET	`1,3`
	COMMENT	`a(n) = GCD(A070939(n), A000120(n));` `a(A000225(n)) = n and a(m) < n for m < A000225(n).`
	LINKS	`Index entries for sequences related to binary expansion of n`
	CROSSREFS	`Cf. A099248, A099247, A099249, A099245, A099246, A007088.` `Adjacent sequences: A099241 A099242 A099243 this_sequence A099245 A099246 A099247` `Sequence in context: A073408 A120454 A076511 this_sequence A014671 A029365 A095136`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Oct 08 2004`

page 1

Search completed in 0.002 seconds

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research