The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A265339 a(n) = A263273(A004526(A263273(n))). 4
 0, 0, 1, 1, 2, 3, 3, 2, 4, 4, 7, 9, 6, 6, 19, 10, 8, 12, 9, 7, 10, 5, 5, 19, 12, 8, 13, 13, 22, 27, 21, 18, 64, 28, 23, 36, 18, 21, 55, 11, 20, 57, 57, 24, 58, 37, 25, 30, 24, 15, 73, 31, 26, 39, 27, 22, 28, 16, 11, 64, 30, 23, 31, 14, 16, 55, 15, 20, 46, 46, 17, 58, 36, 25, 37, 17, 14, 73, 39, 26, 40, 40 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS When permutation A263273 is viewed as a binary tree, a(n) gives the parent node of node containing n, for all n >= 1. Each n occurs exactly twice in the sequence. LINKS Antti Karttunen, Table of n, a(n) for n = 0..16384 FORMULA a(n) = A263273(A004526(A263273(n))). PROG (Scheme) (define (A265339 n) (A263273 (A004526 (A263273 n)))) CROSSREFS Cf. A004526, A263273, A265340. Sequence in context: A373345 A308284 A036465 * A182865 A131469 A309076 Adjacent sequences: A265336 A265337 A265338 * A265340 A265341 A265342 KEYWORD nonn,base,look AUTHOR Antti Karttunen, Dec 18 2015 STATUS approved

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

Last modified June 16 13:05 EDT 2024. Contains 373429 sequences. (Running on oeis4.)