OFFSET
1,2
COMMENTS
This sequence has similarities with A002048; here we use XOR, there addition.
All powers of 2 appear.
LINKS
Rémy Sigrist, Table of n, a(n) for n = 1..10000
FORMULA
Apparently, a(A246360(k)) = 2^(k-1) for any k > 0.
EXAMPLE
n a(n) a(k) XOR ... XOR a(n) for k=1..n
-- ---- -------------------------------------
1 1 1
2 2 3, 2
3 4 7, 6, 4
4 5 2, 3, 1, 5
5 8 10, 11, 9, 13, 8
6 12 6, 7, 5, 1, 4, 12
7 14 8, 9, 11, 15, 10, 2, 14
8 16 24, 25, 27, 31, 26, 18, 30, 16
9 17 9, 8, 10, 14, 11, 3, 15, 1, 17
10 19 26, 27, 25, 29, 24, 16, 28, 18, 2, 19
PROG
(PARI) s=2^0; for (n=1, #a=vector(61), print1 (a[n]=valuation(s+1, 2)", "); z=0; forstep (k=n, 1, -1, s=bitor(s, 2^z=bitxor(z, a[k]))))
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Rémy Sigrist, May 29 2021
STATUS
approved