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.

A064841 Working in base 2, replace n with the concatenation of its prime divisors in increasing order.

Original entry on oeis.org

1, 10, 11, 1010, 101, 1011, 111, 101010, 1111, 10101, 1011, 101011, 1101, 10111, 11101, 10101010, 10001, 101111, 10011, 1010101, 11111, 101011, 10111, 10101011, 101101, 101101, 111111, 1010111, 11101, 1011101, 11111, 1010101010, 111011
Offset: 1

Views

Author

N. J. A. Sloane, Oct 31 2001

Keywords

Examples

			15 = 3*5 -> 11*101 -> 11101, so a(15) = 11101.
		

Crossrefs

See A048985 for same terms written in base 10.

Extensions

More terms from Larry Reeves (larryr(AT)acm.org) and Robert G. Wilson v, Nov 01 2001