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.

A260431 Permutation of natural numbers: a(1) = 1, a(A257804(n)) = 2*a(n), a(A257803(1+n)) = 1 + 2*a(n), where A257804 and A257803 give the positions of even and odd terms in A233271, the infinite trunk of inverted binary beanstalk.

Original entry on oeis.org

1, 2, 4, 3, 8, 6, 5, 16, 9, 12, 10, 7, 32, 18, 24, 20, 17, 13, 14, 64, 11, 36, 33, 19, 25, 48, 21, 40, 34, 15, 26, 28, 128, 65, 37, 22, 72, 49, 66, 38, 41, 35, 50, 96, 42, 80, 68, 30, 27, 52, 56, 29, 129, 23, 73, 256, 67, 130, 74, 39, 44, 144, 98, 51, 97, 132, 76, 43, 82, 81, 70, 100, 69, 31, 53, 57, 257, 192, 84, 160, 131, 75, 45, 136, 60, 54
Offset: 1

Views

Author

Antti Karttunen, Jul 27 2015

Keywords

Links

Crossrefs

Inverse: A260432.
Related permutations: A260433, A260430, A054429.
Cf. A257800, A257803, A257804, A257807, A257808, A233271.
Cf. also A257806.

Formula

a(1) = 1; for n > 1, if A257800(n) = 0 [when n is one of the terms of A257804] a(n) = 2*a(A257808(n)), otherwise [when n is one of the terms of A257803] a(n) = 1 + 2*a(A257807(n)-1).
As a composition of other permutations:
a(n) = A054429(A260433(n)).
a(n) = A260433(A260430(n)).

A260434 Permutation of natural numbers: a(1) = 1, a(2n) = A257803(1+a(n)), a(2n+1) = A257804(a(n)), where A257803 and A257804 give the positions of odd and even terms in A233271, the infinite trunk of inverted binary beanstalk.

Original entry on oeis.org

1, 4, 2, 12, 6, 7, 3, 30, 19, 18, 10, 21, 11, 9, 5, 74, 48, 52, 32, 49, 31, 25, 15, 54, 36, 27, 16, 24, 14, 17, 8, 172, 125, 118, 85, 128, 89, 76, 51, 119, 86, 75, 50, 64, 43, 38, 26, 132, 92, 83, 61, 68, 45, 41, 28, 60, 40, 35, 22, 42, 29, 23, 13, 383, 314, 275, 219, 266, 208, 201, 152, 283, 227, 207, 159, 174, 129, 127, 88
Offset: 1

Views

Author

Antti Karttunen, Jul 27 2015

Keywords

Comments

This sequence can be represented as a binary tree. Each left hand child is produced as A257803(1+n), and each right hand child as A257804(n), when the parent contains n:
|
...................1...................
4 2
12......../ \........6 7......../ \........3
/ \ / \ / \ / \
/ \ / \ / \ / \
/ \ / \ / \ / \
30 19 18 10 21 11 9 5
74 48 52 32 49 31 25 15 54 36 27 16 24 14 17 8
etc.
Note how this is a mirror image of the tree shown in A260432.

Links

Crossrefs

Inverse: A260433.
Related permutations: A260432, A260430, A054429.
Cf. A257803, A257804, A257807, A257808.
Cf. also A233271, A257806.

Formula

a(1) = 1, a(2n) = A257803(1+a(n)), a(2n+1) = A257804(a(n)).
As a composition of other permutations:
a(n) = A260432(A054429(n)).
a(n) = A260430(A260432(n)).
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.