A324337 a(n) = A002487(A006068(n)).

0, 1, 2, 1, 3, 2, 1, 3, 4, 3, 2, 5, 1, 4, 5, 3, 5, 4, 3, 7, 2, 7, 8, 5, 1, 5, 7, 4, 7, 5, 3, 8, 6, 5, 4, 9, 3, 10, 11, 7, 2, 9, 12, 7, 11, 8, 5, 13, 1, 6, 9, 5, 10, 7, 4, 11, 9, 7, 5, 12, 3, 11, 13, 8, 7, 6, 5, 11, 4, 13, 14, 9, 3, 13, 17, 10, 15, 11, 7, 18, 2, 11, 16, 9, 17, 12, 7, 19, 14, 11, 8, 19, 5, 18, 21, 13, 1, 7, 11, 6, 13, 9, 5, 14, 13, 10

Offset

0,3

Comments

Like in A324338, a few terms preceding each position n = 2^k seem to be a batch of nearby Fibonacci numbers in some order.

For all n > 0 A324338(n)/A324337(n) constitutes an enumeration system of all positive rationals. For all n > 0 A324338(n) + A324337(n) = A071585(n). - Yosu Yurramendi, Oct 22 2019

Links

Antti Karttunen, Table of n, a(n) for n = 0..16384

Antti Karttunen, Data supplement: n, a(n) computed for n = 0..65537

Index entries for sequences related to binary expansion of n

Index entries for sequences related to Stern's sequences

Formula

From Yosu Yurramendi, Oct 22 2019: (Start)

a(2^m+ k) = A324338(2^m+2^(m-1)+k), m > 0, 0 <= k < 2^(m-1)

a(2^m+2^(m-1)+k) = A324338(2^m+ k), m > 0, 0 <= k < 2^(m-1). (End)

a(n) = A324338(A063946(n)), n > 0. Yosu Yurramendi, Nov 04 2019

a(n) = A002487(A248663(A283477(n))). - Antti Karttunen, Nov 06 2019

a(n) = A002487(1+A233279(n)). - Yosu Yurramendi, Nov 08 2019

From Yosu Yurramendi, Nov 28 2019: (Start)

a(2^(m+1)+k) - a(2^m+k) = A324338(k), m >= 0, 0 <= k < 2^m.

a(A059893(2^(m+1)+A001969(k+1))) - a(A059893(2^m+A001969(k+1))) =

A071585(k)), m >= 0, 0 <= k < 2^(m-1).

a(A059893(2^(m+1)+ A000069(k+1))) = A071585(k), m >= 1, 0 <= k < 2^(m-1). (End)

From Yosu Yurramendi, Nov 29 2019: (Start)

For n > 0:

A324338(n) + A324337(n) = A071585(n).

A324338(2*A001969(n) )-A324337(2*A001969(n) ) = A071585(n-1)

A324338(2*A001969(n)+1)-A324337(2*A001969(n)+1) = -A324337(n-1)

A324338(2*A000069(n) )-A324337(2*A000069(n) ) = -A071585(n-1)

A324338(2*A000069(n)+1)-A324337(2*A000069(n)+1) = A324338(n-1) (End)

a(n) = A002487(1+A233279(n)). Yosu Yurramendi, Dec 27 2019

Mathematica

Block[{f}, f[m_] := Module[{a = 1, b = 0, n = m}, While[n > 0, If[OddQ[n], b = a + b, a = a + b]; n = Floor[n/2]]; b]; Array[f@ Fold[BitXor, #, Quotient[#, 2^Range[BitLength[#] - 1]]] &, 106, 0]] (* Michael De Vlieger, Dec 14 2019, after Jean-François Alcover at A002487 and Jan Mangaldan at A006068 *)

Prog

(PARI)
A006068(n)= { my(s=1, ns); while(1, ns = n >> s; if(0==ns, break()); n = bitxor(n, ns); s <<= 1; ); return (n); } \\ From A006068
A002487(n) = { my(s=sign(n), a=1, b=0); n = abs(n); while(n>0, if(bitand(n, 1), b+=a, a+=b); n>>=1); (s*b); };
A324337(n) = A002487(A006068(n));
(R)
maxlevel <- 6 # by choice
#
b <- 0; A324338 <- 1; A324337 <- 1
for(i in 1:2^maxlevel) {
  b[2*i  ] <-     b[i]
  b[2*i+1] <- 1 - b[i]
  A324338[2*i  ] <- A324338[i]          + A324337[i]*   b[i]
  A324338[2*i+1] <- A324338[i]          + A324337[i]*(1-b[i])
  A324337[2*i  ] <- A324338[i]*(1-b[i]) + A324337[i]
  A324337[2*i+1] <- A324338[i]*   b[i]  + A324337[i]}
#
A324338[1:127]; A324337[1:127]
# Yosu Yurramendi, Oct 22 2019

Crossrefs

Cf. A002487, A006068, A063946, A071585, A248663, A283477, A324287, A324338.

Sequence in context: A195079 A124458 A199538 * A002973 A071476 A071499

Adjacent sequences: A324334 A324335 A324336 * A324338 A324339 A324340

Keyword

nonn

Author

Antti Karttunen, Feb 23 2019

Status

approved