The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A181935 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A181935

Curling number of binary expansion of n.
(history; published version)

#22 by Charles R Greathouse IV at Sat Jul 13 12:03:44 EDT 2013

LINKS

_Reinhard Zumkeller_, , <a href="/A181935/b181935.txt">Table of n, a(n) for n = 0..8191</a>

Discussion

Sat Jul 13

12:03

OEIS Server: https://oeis.org/edit/global/1934

#21 by N. J. A. Sloane at Sat Apr 27 09:55:48 EDT 2013

STATUS

editing

approved

#20 by N. J. A. Sloane at Sat Apr 27 09:55:46 EDT 2013

CROSSREFS

Cf. A005132A212412 (parity), A212440, A212441, A007088, A090822, A224764/A224765 (fractional curling number).

Cf. A212412 (parity), A212440, A212441, A007088.

STATUS

approved

editing

#19 by N. J. A. Sloane at Fri Feb 22 21:38:33 EST 2013

LINKS

_Reinhard Zumkeller, _, <a href="/A181935/b181935.txt">Table of n, a(n) for n = 0..8191</a>

Discussion

Fri Feb 22

21:38

OEIS Server: https://oeis.org/edit/global/1866

#18 by Charles R Greathouse IV at Thu Oct 04 10:29:17 EDT 2012

LINKS

Benjamin Chaffin and N. J. A. Sloane, <a href="http://www.research.attneilsloane.com/~njas/doc/CNC.pdf">The Curling Number Conjecture</a>, preprint.

Discussion

Thu Oct 04

10:29

OEIS Server: https://oeis.org/edit/global/1833

#17 by OEIS Server at Thu May 17 12:51:56 EDT 2012

LINKS

Reinhard Zumkeller, <a href="/A181935/b181935_2.txt">Table of n, a(n) for n = 0..8191</a>

#16 by T. D. Noe at Thu May 17 12:51:56 EDT 2012

STATUS

editing

approved

Discussion

Thu May 17

12:51

OEIS Server: Installed new b-file as b181935.txt.  Old b-file is now b181935_2.txt.

#15 by T. D. Noe at Thu May 17 12:51:51 EDT 2012

KEYWORD

nonn,changed,base

#14 by Reinhard Zumkeller at Thu May 17 09:04:57 EDT 2012

DATA

1, 1, 1, 2, 2, 1, 1, 3, 3, 1, 2, 2, 2, 1, 1, 4, 4, 1, 1, 2, 2, 2, 1, 3, 3, 1, 2, 2, 2, 1, 1, 5, 5, 1, 1, 2, 2, 2, 1, 3, 3, 1, 3, 2, 2, 2, 1, 4, 4, 1, 1, 2, 2, 2, 2, 3, 3, 1, 2, 2, 2, 1, 1, 6, 6, 1, 1, 2, 2, 2, 1, 3, 3, 2, 2, 2, 2, 1, 1, 4, 4, 1, 2, 2, 2, 3

COMMENTS

A212439(n) = 2 * n + a(n) mod 2. - Reinhard Zumkeller, May 17 2012

LINKS

Benjamin Chaffin and N. J. A. Sloane, <a href="http://www.research.att.com/~njas/doc/CNC.pdf">The Curling Number Conjecture</a>, preprint.

EXAMPLE

731 = 1011011011 in binary, which we could write as XY^2 with X = 10110110 and Y = 1, or as XY^3 with X = 1 and Y = 011. The latter is better, giving k = 3, so a(713) = 3.

MAPLE

731 = 1011011011 in binary, which we could write as XY^2 with X = 10110110 and Y = 1, or as XY^3 with X = 1 and Y = 011. The latter is better, giving k = 3, so a(713) = 3.

PROG

-- import Data.List (unfoldr, inits, tails, stripPrefix)

-- import Data.Maybe (fromJust)

CROSSREFS

Cf. A212412 (parity), A212440, A212441, A007088.

#13 by Reinhard Zumkeller at Thu May 17 08:59:39 EDT 2012

LINKS

Reinhard Zumkeller, <a href="/A181935/b181935_12.txt">Table of n, a(n) for n = 0..100008191</a>