This site is supported by donations to The OEIS Foundation. Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A255683 Sum of the binary numbers whose digits are cyclic permutations of the binary expansion of n 1

%I

%S 1,3,6,7,14,14,21,15,30,30,45,30,45,45,60,31,62,62,93,62,93,93,124,62,

%T 93,93,124,93,124,124,155,63,126,126,189,126,189,189,252,126,189,189,

%U 252,189,252,252,315,126,189,189,252,189,252,252,315,189,252,252,315

%N Sum of the binary numbers whose digits are cyclic permutations of the binary expansion of n

%C a(2^n) = Sum_{k=1..n} 2^k = 2^(n+1)-1.

%C a(5+4*k) = a(6+4*k), for k >= 0.

%C All the primes in the sequence are Mersenne primes (A000668).

%H Paolo P. Lava, <a href="/A255683/b255683.txt">Table of n, a(n) for n = 1..1000</a>

%F For n >= 0 and 0 <= i <= 2^n - 1 we conjecture a(2^n + i) = (2^(n+1) - 1)*A063787(i+1). An example is given below. - _Peter Bala_, Mar 02 2015

%e 6 in base 2 is 110 and all the cyclic permutations of its digits are: 110, 101, 011. In base 10 they are 6, 5, 3 and their sum is 6 + 5 + 3 = 14.

%e From _Peter Bala_, Mar 02 2015: (Start)

%e Let b(n) = A063787(n), beginning [1, 2, 2, 3, 2, 3, 3, 4, ...]. Then

%e [a(1)] = 1*[b(1)]; [a(2), a(3)] = 3*[b(1), b(2)];

%e [a(4), a(5), a(6), a(7)] = 7*[b(1), b(2), b(3), b(4)];

%e [a(8), a(9), a(10), a(11), a(12), a(13), a(14), a(15)] = 15*[b(1), b(2), b(3), b(4), b(5), b(6), b(7), b(8)].

%e It is conjectured that this relationship continues. (End)

%p with(numtheory): P:=proc(q) local a,b,c,k,n;

%p for n from 1 to q do a:=convert(n,binary,decimal); b:=n; c:=ilog10(a);

%p for k from 1 to c do a:=(a mod 10)*10^c+trunc(a/10); b:=b+convert(a,decimal,binary); od;

%p print(b); od; end: P(1000);

%t f[n_] := Block[{b = 2, w = IntegerDigits[n, b]}, Apply[Plus, FromDigits[#, b] & /@ (RotateRight[w, #] & /@ Range[Length@ w])]]; Array[f, 60] (* _Michael De Vlieger_, Mar 04 2015 *)

%t Table[Total[FromDigits[#,2]&/@Table[RotateRight[IntegerDigits[k,2],n],{n,IntegerLength[k,2]}]],{k,60}] (* _Harvey P. Dale_, Jan 03 2018 *)

%Y Cf. A000225, A000668, A063787.

%K nonn,base,easy

%O 1,2

%A _Paolo P. Lava_, Mar 02 2015

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 December 12 17:33 EST 2019. Contains 329960 sequences. (Running on oeis4.)