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.

A268680 Least monotonic left inverse of A268678.

Original entry on oeis.org

0, 1, 1, 2, 3, 4, 4, 5, 6, 6, 6, 7, 7, 7, 7, 8, 9, 9, 10, 11, 12, 12, 13, 14, 14, 14, 15, 16, 16, 16, 16, 17, 18, 18, 19, 19, 20, 21, 21, 21, 22, 23, 24, 24, 24, 24, 24, 25, 26, 26, 27, 27, 28, 29, 29, 29, 30, 31, 31, 32, 33, 33, 33, 33, 34, 35, 36, 36, 36, 37, 38, 38, 39, 39, 40, 41, 41, 41, 41, 41, 41, 42, 43, 44
Offset: 0

Views

Author

Antti Karttunen, Feb 11 2016

Keywords

Comments

a(n) = number of distinct nonzero values A268395 that occur in range [0 .. n].
Each n occurs A268679(n+1) times.

Crossrefs

Cf. also A268711.

Formula

Other identities. For all n >= 0:
a(A268678(n)) = n.

A268712 Permutation of natural numbers: a(1) = 1, a(2n) = A268677(a(n)), a(2n+1) = A268678(1+a(n)).

Original entry on oeis.org

1, 2, 3, 6, 4, 9, 5, 13, 11, 10, 7, 21, 18, 12, 8, 29, 23, 25, 20, 24, 19, 14, 15, 45, 40, 39, 34, 28, 22, 17, 16, 62, 56, 49, 42, 54, 48, 44, 37, 51, 47, 43, 36, 30, 26, 33, 27, 95, 87, 84, 75, 80, 74, 73, 65, 61, 53, 46, 41, 38, 32, 35, 31, 129, 120, 115, 108, 100, 93, 88, 82, 112, 105, 99, 92, 94, 86, 78, 70
Offset: 1

Views

Author

Antti Karttunen, Feb 11 2016

Keywords

Comments

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

Crossrefs

Inverse: A268711.

Formula

a(1) = 1, after which: a(2n) = A268677(a(n)), a(2n+1) = A268678(1+a(n)).
Showing 1-2 of 2 results.