id:A140191 - OEIS Search Results

Search: id:A140191

Displaying 1-1 of 1 results found.

page 1

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

+0
5

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

	OFFSET	`0,4`
	COMMENT	`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`
	PROGRAM	`See link for Fortran program.`
	CROSSREFS	`Cf. A140192-A140195.` `Adjacent sequences: A140188 A140189 A140190 this_sequence A140192 A140193 A140194` `Sequence in context: A037161 A133255 A141289 this_sequence A048207 A105810 A063726`
	KEYWORD	`nonn`
	AUTHOR	`Nadia Heninger (nadiah(AT)cs.princeton.edu) and njas, Jun 06 2008`

page 1

Search completed in 0.002 seconds

Last modified October 6 16:13 EDT 2008. Contains 144667 sequences.

AT&T Labs Research