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.

A323752 Fixed points of A323710.

Original entry on oeis.org

1, 6, 28, 40, 240, 544, 832, 1152, 2816, 50176, 118784, 131584, 409600, 1050624, 1056768, 1081344, 2031616, 8519680, 118489088, 201588736, 352321536, 6446645248, 15300820992, 25836912640, 104152956928, 150323855360, 1099545182208, 3315714752512, 4398583382016
Offset: 1

Views

Author

Luc Rousseau, Jan 26 2019

Keywords

Comments

If f(n) denotes the binary tree representation of n defined in A323710, then this sequence lists the n such that f(n) is symmetrical.

Examples

			The recursive decomposition of 50176 with formula "parent = (2^left)*(2*right+1)" gives the following binary tree representation:
         o
        / \
       /   \
      /     \
     o       o
    / \     / \
   o   o   o   o
      /     \
     o       o
This tree is symmetrical, so 50176 is in the sequence.
		

Crossrefs

Cf. A323710.