cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A171885 Representation of n in D. E. Knuth's second prefix-unambiguous, order-preserving binary string system.

Original entry on oeis.org

0, 1, 4, 5, 24, 25, 26, 27, 112, 113, 114, 115, 116, 117, 118, 119, 480, 481, 482, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001
Offset: 0

Views

Author

Robert Munafo, Mar 19 2010

Keywords

Comments

The first two terms are the strings "00" and "01"; all others are binary strings beginning with "1".
With the important exception of a(1) = 1, when expressed in binary, any value not appearing in this sequence appears as an initial substring of later terms. For example, 6 (110) is an initial substring of 27 (11011).
From n = 128 on, a(n) > A010097(n), but the terms of the two sequences remain approximately the same size up to n = 511. - M. F. Hasler, Oct 24 2024

Examples

			The representations start: 0 = "00"; 1 = "01"; 2 = "100"; 3 = "101"; 4 = "11000"; 5 = "11001"; 6 = "11010"; 7 = "11011"; 8 = "1110000"; 9 = "1110001"; and so on. See the references for longer lists and fuller explanation.
		

References

  • Donald E. Knuth, "Supernatural Numbers", in D. A. Klarner, editor, The Mathematical Gardner. Prindle, Weber and Schmidt, Boston, 1981, pp. 310-325.
  • Donald E. Knuth, Selected Papers on Fun and Games. Stanford, California: Center for the Study of Language and Information (2011).

Crossrefs

Knuth's first system gives A000918 (less its initial term).
Knuth's third system is A010097, the Levenshtein codes.

Programs

  • PARI
    apply( {A171885(n)=if(n>1, n-3<<(n=exponent(n))+2*4^n, n)}, [0..44]) \\ M. F. Hasler, Oct 24 2024

Formula

a(n) = n + 2*4^L - 3*2^L with L = floor(log_2(n)), for n > 1. - M. F. Hasler, Oct 24 2024
Showing 1-1 of 1 results.