login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A140191 Fix e = 3; a(n) gives number of multiples ke (0 <= k <= n/e) which are children of n. 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; refs; listen; history; text; 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
PROG
(Fortran) See Sloane link.
CROSSREFS
Sequence in context: A332089 A177219 A277700 * A317840 A048207 A359164
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 11:14 EDT 2024. Contains 371278 sequences. (Running on oeis4.)