login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A205649 Hamming distance between twin primes. 15

%I #17 Aug 03 2014 14:01:38

%S 2,1,2,1,1,1,2,3,1,2,1,1,2,6,1,2,4,1,1,3,2,2,4,1,1,1,3,1,1,2,1,1,2,1,

%T 1,2,3,1,1,2,7,1,1,1,1,3,2,2,1,4,3,2,2,1,1,2,4,1,2,1,1,2,1,3,6,1,1,1,

%U 2,1,2,1,1,5,1,7,3,1,1,1,1,3,4,5,2,1,2

%N Hamming distance between twin primes.

%C Twin primes for which a(n)=1 are in A122565.

%C Conjecture: The sequence is unbounded.

%H T. D. Noe, <a href="/A205649/b205649.txt">Table of n, a(n) for n = 1..10000</a>

%F A001359(n) == -1 (mod 2^a(n)).

%t nn = 1000; ps = Prime[Range[nn]]; t = {}; Do[If[ps[[n]] + 2 == ps[[n + 1]], AppendTo[t, ps[[n]]]], {n, nn - 1}]; Table[b2 = IntegerDigits[t[[k]] + 2, 2]; b1 = IntegerDigits[t[[k]], 2, Length[b2]]; Total[Abs[b1 - b2]], {k, Length[t]}] (* _T. D. Noe_, Jan 30 2012 *)

%Y Cf. A205510, A001097, A001359, A006512, A205302, A205511, A205533.

%K nonn,base

%O 1,1

%A _Vladimir Shevelev_, Jan 30 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)