login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A153834 Index sequence to A089840: position of A089840(n) when applied to the right hand side subtree. 3

%I

%S 0,3,23,27,29,33,35,46,50,52,56,58,3655,3659,3667,3677,3681,3747,3751,

%T 3759,3763,3771,277,281,283,287,289,299,301,305,307,311,313,323,325,

%U 329,331,335,337,347,349,353,355,359,361,396,400,402,406,408,418,420

%N Index sequence to A089840: position of A089840(n) when applied to the right hand side subtree.

%C The comments at A123694 concerning counts of fixed points apply also here.

%H A. Karttunen, <a href="/A089839/a089839.c.txt">C-program for computing the initial terms of this sequence</a>

%e When A089840(1) = A069770 (swap binary tree sides) is applied to the right subtree of a binary tree, we get A089850 = A089840(3), thus a(1)=3. When A089840(12) = A074679 is applied to the right subtree of a binary tree, we get A154121 = A089840(3655), thus a(12)=3655.

%Y a(n) < A123694(n) for all n > 0. Used to construct A153832 and A153833.

%K nonn

%O 0,2

%A _Antti Karttunen_, Jan 07 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 14 22:42 EST 2019. Contains 329987 sequences. (Running on oeis4.)