The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A329905 a(1) = 0; a(2) = 1; and for n > 2, a(n) = A330682(n) + 2*a(A329904(n)). 5
 0, 1, 2, 3, 4, 6, 8, 12, 7, 16, 5, 24, 14, 32, 10, 48, 28, 64, 20, 13, 96, 15, 9, 56, 128, 40, 26, 192, 30, 18, 112, 256, 80, 52, 384, 60, 36, 11, 224, 512, 25, 160, 29, 17, 104, 768, 120, 72, 22, 448, 1024, 50, 320, 31, 58, 34, 208, 1536, 240, 144, 44, 896, 2048, 100, 640, 62, 116, 68, 21, 416, 3072, 27, 49, 480, 288, 88, 57 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS Note the indexing: domain begins from one, but the range contains also zero. LINKS Antti Karttunen, Table of n, a(n) for n = 1..10000 FORMULA a(1) = 0; a(2) = 1; and for n > 2, if A181815(n) is odd, a(n) = 1 + 2*a(A329904(n)), otherwise a(n) = 2*a(A329904(n)). a(n) = A243071(A181815(n)). For all n >= 1, A000120(a(n)) = A061394(n). For all n >= 2, A070939(a(n)) = A329907(n). PROG (PARI) A329905(n) = if(n<=2, n-1, (A181815(n)%2)+2*(A329905(A329904(n)))); CROSSREFS Cf. A329906 (inverse permutation). Cf. A000035, A025487, A061394, A181815, A243071, A329897, A329898, A329904, A329907, A330682. Sequence in context: A211397 A173542 A323383 * A085113 A129121 A018556 Adjacent sequences:  A329902 A329903 A329904 * A329906 A329907 A329908 KEYWORD nonn AUTHOR Antti Karttunen, Dec 24 2019 STATUS approved

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.

Last modified April 18 07:59 EDT 2021. Contains 343084 sequences. (Running on oeis4.)