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.

A253888 a(0) = 1; for n >= 1: a(n) = A048673(1+(2*A064216(n))).

Original entry on oeis.org

1, 3, 4, 6, 7, 13, 18, 15, 9, 63, 39, 28, 43, 12, 10, 27, 31, 16, 19, 138, 88, 123, 45, 25, 78, 48, 30, 81, 24, 73, 55, 105, 22, 36, 108, 72, 438, 111, 21, 37, 303, 33, 148, 42, 93, 87, 103, 213, 54, 91, 58, 298, 171, 34, 363, 165, 172, 198, 102, 49, 69, 163, 76, 46, 115, 228, 333, 288, 61, 135, 319, 90, 130, 75, 52
Offset: 0

Views

Author

Antti Karttunen, Jan 22 2015

Keywords

Comments

When A048673 is represented as a binary tree, then the node k which contains value n = A048673(k) has as its right child a(n) = A048673(2k+1).

Crossrefs

Same sequence sorted into ascending order: A032766.
Also a permutation of A254049.

Formula

a(0) = 1; for n >= 1: a(n) = A048673(1+(2*A064216(n))).
Also, for n >= 1: a(n) = A254049(1+A064216(n)).