A140191 - OEIS

This site is supported by donations to The OEIS Foundation.

A140191

Fix e = 3; a(n) gives number of multiples ke (0 <= k <= n/e) which are children of n.

1, 1, 1, 2, 1, 1, 2, 3, 1, 2, 1, 3, 2, 3, 3, 6, 1, 1, 2, 3, 1, 2, 3, 5, 2, 3, 3, 6, 3, 5, 6, 11, 1, 2, 1, 3, 2, 3, 3, 6, 1, 3, 2, 5, 3, 6, 5, 11, 2, 3, 3, 6, 3, 5, 6, 11, 3, 6, 5, 11, 6, 11, 11, 22, 1, 1, 2, 3, 1, 2, 3, 5, 2, 3, 3, 6, 3, 5, 6, 11, 1, 2, 3, 5, 2, 5, 5, 10, 3, 5, 6, 11, 5, 10, 11, 21, 2, 3, 3, 6 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,4`
	COMMENTS	`A number m is a child of n if the binary representation of n has a 1 in every position where the binary representation of m has a 1.`
	LINKS	`Nadia Heninger and N. J. A. Sloane, Table of n, a(n) for n = 0..3000` `N. J. A. Sloane, Fortran program for this and related sequences`
	PROG	`See link for Fortran program.`
	CROSSREFS	`Cf. A140192-A140195.` `Sequence in context: A109671 A141289 A177219 * A048207 A105810 A063726` `Adjacent sequences: A140188 A140189 A140190 * A140192 A140193 A140194`
	KEYWORD	`nonn`
	AUTHOR	`Nadia Heninger (nadiah(AT)cs.princeton.edu) and N. J. A. Sloane (njas(AT)research.att.com), Jun 06 2008`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 06:46 EST 2012. Contains 205867 sequences.