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.

A279343 a(1) = 0, and for n > 1, if A079559(n) = 0, a(n) = 1 + 2*a(A256992(n)), otherwise a(n) = 2*a(A256992(n)).

Original entry on oeis.org

0, 1, 2, 4, 3, 5, 8, 6, 9, 10, 16, 7, 11, 17, 12, 18, 13, 20, 32, 19, 21, 14, 22, 33, 34, 24, 15, 23, 35, 25, 36, 26, 37, 40, 64, 27, 41, 38, 42, 65, 28, 44, 39, 43, 29, 66, 68, 45, 48, 30, 67, 69, 46, 70, 49, 50, 72, 31, 47, 71, 51, 73, 52, 74, 53, 80, 128, 75, 81, 54, 82, 129, 76, 84, 55, 83, 77, 130, 56, 85, 88, 78, 131, 57, 86
Offset: 1

Views

Author

Antti Karttunen, Dec 10 2016

Keywords

Comments

Note the indexing: the domain starts from 1, while the range includes also zero.

Crossrefs

Inverse: A279344.
Related or similar permutations: A054429, A156552, A279338, A279341, A279347.

Programs

Formula

a(1) = 0, and for n > 1, if A079559(n) = 0 [when n is a term of A055938], a(n) = 1 + 2*a(A256992(n)), otherwise a(n) = 2*a(A256992(n)).
As a composition of other permutations:
a(n) = A054429(A279341(n)).
a(n) = A279341(A279347(n)).
a(n) = A156552(A279338(n)).
Other identities. For all n >= 1:
A000120(a(n)) = A279346(n).
For all n >= 2, A070939(a(n)) = A256993(n).