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.

A275727 a(0) = 0, for n >= 1, a(n) = A275736(n) + 2*a(A257684(n)).

Original entry on oeis.org

0, 1, 2, 3, 2, 3, 4, 5, 6, 7, 6, 7, 4, 5, 6, 7, 6, 7, 4, 5, 6, 7, 6, 7, 8, 9, 10, 11, 10, 11, 12, 13, 14, 15, 14, 15, 12, 13, 14, 15, 14, 15, 12, 13, 14, 15, 14, 15, 8, 9, 10, 11, 10, 11, 12, 13, 14, 15, 14, 15, 12, 13, 14, 15, 14, 15, 12, 13, 14, 15, 14, 15, 8, 9, 10, 11, 10, 11, 12, 13, 14, 15, 14, 15, 12, 13, 14, 15
Offset: 0

Views

Author

Antti Karttunen, Aug 09 2016

Keywords

Comments

a(n) has ones in those positions of its base-2 representation where n has nonzero digits in its factorial base representation.

Examples

			For n=19, A007623(19) = 301, thus a(19) = 5 because A007088(5) = 101.
		

Crossrefs

Formula

a(0) = 0, for n >= 1, a(n) = A275736(n) + 2*a(A257684(n)).
a(n) = A048675(A275733(n)).
Other identities and observations. For all n >= 0:
A000120(a(n)) = A060130(n).