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

A266418 Permutation of natural numbers: a(1) = 1, a(2n) = A266410(a(n)), a(2n+1) = A266409(1+a(n)).

Original entry on oeis.org

1, 4, 2, 10, 6, 7, 3, 22, 20, 15, 11, 16, 12, 9, 5, 40, 53, 37, 45, 29, 33, 24, 21, 31, 35, 25, 23, 19, 18, 13, 8, 68, 111, 85, 156, 64, 104, 75, 123, 51, 74, 56, 87, 43, 59, 39, 48, 54, 80, 61, 90, 46, 60, 42, 57, 36, 44, 34, 41, 27, 26, 17, 14, 107, 210, 167, 387, 133, 276, 229, 573, 101, 198, 158, 351, 120
Offset: 1

Views

Author

Antti Karttunen, Jan 28 2016

Keywords

Comments

This sequence can be represented as a binary tree. Each left hand child is produced as A266410(n), and each right hand child as A266409(1+n), when the parent node contains n:
|
...................1...................
4 2
10......../ \........6 7......../ \........3
/ \ / \ / \ / \
/ \ / \ / \ / \
/ \ / \ / \ / \
22 20 15 11 16 12 9 5
40 53 37 45 29 33 24 21 31 35 25 23 19 18 13 8
etc.

Links

Crossrefs

Inverse: A266417.
Cf. A266409, A266410.
Similar or related permutations: A237126, A266638.

Formula

a(1) = 1, after which: a(2n) = A266410(a(n)), a(2n+1) = A266409(1+a(n)).
As a composition of related permutations:
a(n) = A266638(A237126(n)).

A266350 Partial sums of f(n) = A192490(2n+1); least monotonic left inverse of A266409.

Original entry on oeis.org

1, 2, 3, 3, 4, 5, 5, 6, 6, 6, 7, 8, 8, 9, 9, 9, 9, 10, 10, 11, 12, 12, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 16, 16, 17, 17, 17, 18, 18, 18, 19, 19, 19, 20, 21, 21, 21, 22, 22, 22, 22, 22, 23, 23, 23, 23, 24, 24, 25, 26, 26, 26, 27, 27, 28, 28, 28, 28, 28, 28, 29, 29, 29, 30, 30, 30, 30, 31, 31, 32, 32
Offset: 1

Views

Author

Antti Karttunen, Jan 28 2016

Keywords

Links

Crossrefs

Cf. A192490, A266409.
Cf. also permutations A266417, A266637.

Formula

a(1) = 1; for n > 1, a(n) = a(n-1) + A192490(2n + 1).
Other identities. For all n >= 1:
a(A266409(n)) = n.

A266637 a(1) = 1; for n > 1, if A192490(2*n + 1) = 1 [when 2n+1 is a Ludic number] a(n) = A003309(1+a(A266350(n)-1)), otherwise a(n) = A192607(a(n-A266350(n))).

Original entry on oeis.org

1, 2, 3, 4, 5, 7, 6, 11, 8, 9, 17, 13, 10, 37, 14, 12, 19, 23, 15, 25, 67, 16, 43, 27, 21, 29, 18, 52, 22, 181, 20, 30, 47, 34, 41, 24, 36, 77, 88, 26, 97, 59, 39, 53, 115, 32, 42, 407, 28, 70, 33, 224, 61, 31, 44, 64, 227, 49, 121, 89, 57, 35, 131, 51, 71, 101, 113, 38, 125, 79, 287, 55, 72, 91, 146, 46, 58, 1361
Offset: 1

Views

Author

Antti Karttunen, Jan 28 2016

Keywords

Links

Crossrefs

Inverse: A266638.
Cf. A003309, A192490, A192607, A266350.
Related or similar permutations: A237126, A266417.

Formula

a(1) = 1; for n > 1, if A192490(2*n + 1) = 1 [when 2n+1 is Ludic number] a(n) = A003309(1+a(A266350(n)-1)), otherwise a(n) = A192607(a(n-A266350(n))).
As a composition of related permutations:
a(n) = A237126(A266417(n)).
Showing 1-3 of 3 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.