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

Offset: 0

Author

Nadia Heninger and N. J. A. Sloane, Jun 06 2008

Keywords

• nonn

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

Crossrefs

Cf. A140192-A140195.

Programs

Fortran

See Sloane link.