|
%I #8 Jan 26 2019 15:17:15
%S 1,6,28,40,240,544,832,1152,2816,50176,118784,131584,409600,1050624,
%T 1056768,1081344,2031616,8519680,118489088,201588736,352321536,
%U 6446645248,15300820992,25836912640,104152956928,150323855360,1099545182208,3315714752512,4398583382016
%N Fixed points of A323710.
%C 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.
%H Luc Rousseau, <a href="/A323752/b323752.txt">Table of n, a(n) for n = 1..200</a>
%H Luc Rousseau, <a href="/A323752/a323752.pl.txt">A program to compute this sequence (SWI-Prolog)</a>
%e The recursive decomposition of 50176 with formula "parent = (2^left)*(2*right+1)" gives the following binary tree representation:
%e o
%e / \
%e / \
%e / \
%e o o
%e / \ / \
%e o o o o
%e / \
%e o o
%e This tree is symmetrical, so 50176 is in the sequence.
%o (SWI-Prolog) See link.
%Y Cf. A323710.
%K nonn
%O 1,2
%A _Luc Rousseau_, Jan 26 2019
|
