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!)
 A319010 a(0) = 0, a(1) = 1; for n >= 1, a(2*n) = a(2*n-1), a(2*n+1) = 2*(n - a(n)). 1
 0, 1, 1, 0, 0, 2, 2, 6, 6, 8, 8, 6, 6, 8, 8, 2, 2, 4, 4, 2, 2, 4, 4, 10, 10, 12, 12, 10, 10, 12, 12, 26, 26, 28, 28, 26, 26, 28, 28, 34, 34, 36, 36, 34, 34, 36, 36, 26, 26, 28, 28, 26, 26, 28, 28, 34, 34, 36, 36, 34, 34, 36, 36, 10, 10, 12, 12, 10, 10, 12, 12, 18, 18, 20, 20, 18, 18, 20, 20 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,6 LINKS Altug Alkan, Table of n, a(n) for n = 0..8190 PROG (PARI) a = vector(100); print1(0", "); for(k=1, #a, print1 (a[k]=if(k==1, 1, my (n=k\2); if (k%2==0, a[2*n-1], 2*(n-a[n])))", ")); (PARI) a(n) = if(n<=1, n, if(n%2==0, a(n-1), 2*((n-1)/2-a((n-1)/2)))); CROSSREFS Cf. A002487, A303404, A318190. Sequence in context: A130493 A267516 A163118 * A010762 A055993 A309912 Adjacent sequences:  A319007 A319008 A319009 * A319011 A319012 A319013 KEYWORD nonn,easy,look AUTHOR Altug Alkan, Sep 07 2018 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 June 24 18:38 EDT 2021. Contains 345419 sequences. (Running on oeis4.)