This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A268386 a(n) = A193231(A268387(n)). 4
 0, 1, 1, 3, 1, 0, 1, 2, 3, 0, 1, 2, 1, 0, 0, 5, 1, 2, 1, 2, 0, 0, 1, 3, 3, 0, 2, 2, 1, 1, 1, 4, 0, 0, 0, 0, 1, 0, 0, 3, 1, 1, 1, 2, 2, 0, 1, 4, 3, 2, 0, 2, 1, 3, 0, 3, 0, 0, 1, 3, 1, 0, 2, 6, 0, 1, 1, 2, 0, 1, 1, 1, 1, 0, 2, 2, 0, 1, 1, 4, 5, 0, 1, 3, 0, 0, 0, 3, 1, 3, 0, 2, 0, 0, 0, 5, 1, 2, 2, 0, 1, 1, 1, 3, 1, 0, 1, 1, 1, 1, 0, 4, 1, 1, 0, 2, 2, 0, 0, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS Antti Karttunen, Table of n, a(n) for n = 1..16384 FORMULA The following two formulas are equivalent because A193231 distributes over bitwise XOR (A003987): a(n) = A193231(A268387(n)). a(n) = A268387(A268385(n)). MATHEMATICA f[n_] := Which[0 <= # <= 1, #, EvenQ@ #, BitXor[2 #, #] &[f[#/2]], True, BitXor[#, 2 # + 1] &[f[(# - 1)/2]]] &@ Abs@ n; {0}~Join~Table[f[BitXor @@ Map[Last, FactorInteger@ n]], {n, 2, 120}] (* Michael De Vlieger, Feb 12 2016, after Robert G. Wilson v at A048724 and A065621 *) PROG (Scheme) (define (A268386 n) (A193231 (A268387 n))) CROSSREFS Cf. A003987, A193231, A268385, A268387. Cf. A000028 (indices of odd numbers), A000379 (indices of even numbers), A268390 (indices of zeros). Sequence in context: A291624 A291635 A308243 * A122779 A120323 A320476 Adjacent sequences:  A268383 A268384 A268385 * A268387 A268388 A268389 KEYWORD nonn AUTHOR Antti Karttunen, Feb 10 2016 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 October 21 01:18 EDT 2019. Contains 328291 sequences. (Running on oeis4.)