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-2 of 2 results.

A085211 Array A(x,y): concatenation of the binary expansions of x & y in such a way that 'y' is inserted after the least significant 1-bit of 'x', followed by the remaining 0-bits, if any. Listed antidiagonalwise as A(0,0), A(1,0), A(0,1), A(2,0), A(1,1), A(0,2), ... Zero is expanded as an empty string.

Original entry on oeis.org

0, 1, 1, 2, 3, 2, 3, 6, 6, 3, 4, 7, 12, 7, 4, 5, 12, 14, 14, 12, 5, 6, 11, 24, 15, 24, 13, 6, 7, 14, 22, 28, 28, 26, 14, 7, 8, 15, 28, 23, 48, 29, 28, 15, 8, 9, 24, 30, 30, 44, 52, 30, 30, 24, 9, 10, 19, 48, 31, 56, 45, 56, 31, 48, 25, 10, 11, 22, 38, 56, 60, 58, 46, 60, 56, 50, 26, 11
Offset: 0

Views

Author

Antti Karttunen, Jun 23 2003

Keywords

Examples

			A(8,3) = 56 = '1110000' in binary, is produced when '11' (binary expansion of 3) is inserted after the least significant (and only) 1-bit of '1000' (binary expansion of 8).

Crossrefs

Same array in binary: A085213. Transpose: A085212. Variant: A085207 (normal concatenation). Can be used to compute A085203.

Formula

a(0, y) = y, a(x, y) = A006519(x) * (y + ((2^A029837(y+1))*A000265(x))).

A085214 Array A085212 in binary.

Original entry on oeis.org

0, 1, 1, 10, 11, 10, 11, 110, 110, 11, 100, 111, 1100, 111, 100, 101, 1100, 1110, 1110, 1100, 101, 110, 1101, 11000, 1111, 11000, 1011, 110, 111, 1110, 11010, 11100, 11100, 10110, 1110, 111, 1000, 1111, 11100, 11101, 110000, 10111, 11100, 1111, 1000, 1001
Offset: 0

Views

Author

Antti Karttunen, Jun 23 2003

Keywords

Crossrefs

Transpose: A085213.
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

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