login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A140080 Fix e = 3; a(n) = minimal Hamming distance between the binary representation of n and the binary representation of any multiple ke (0 <= k <= n/e) which is a child of n. 10
0, 1, 1, 0, 1, 2, 0, 1, 1, 0, 2, 1, 0, 1, 1, 0, 1, 2, 0, 1, 2, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 2, 1, 0, 1, 1, 0, 2, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 2, 0, 1, 2, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 2, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,6

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.

In other words, this tells us how closely (in Hamming weight) we can approximate n "from below" by a multiple of e.

LINKS

Nadia Heninger and N. J. A. Sloane, Table of n, a(n) for n = 0..5000

N. J. A. Sloane, Fortran program for this and related sequences

EXAMPLE

If n = 14 = 1110_2, take k=2, ke = 6 = 110_2, which is Hamming distance 1 from n. This is the best we can do, so a(14) = 1.

PROG

(Fortran) See Sloane link.

CROSSREFS

For e=2 and 4 through 9 see A000035 and A140081 through A140086.

Cf. A140137, A140138, A140200-A140206.

Sequence in context: A025886 A117355 A086966 * A065359 A087372 A036431

Adjacent sequences:  A140077 A140078 A140079 * A140081 A140082 A140083

KEYWORD

nonn

AUTHOR

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

STATUS

approved

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

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

Last modified November 23 14:53 EST 2014. Contains 249851 sequences.