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!)
A200143 Nodes of degree 1 in graphs of XOR connected primes in successive intervals [2^i+1,2^(i+1)-1], i>=1. 2

%I #27 Nov 12 2020 06:29:40

%S 5,7,11,13,23,47,61,83,131,191,211,223,241,317,331,397,467,479,491,

%T 503,509,563,577,613,727,743,757,829,887,907,941,947,997,1009,1021,

%U 1039,1069,1087,1097,1109,1223,1229,1237,1381,1399,1423,1447,1523,1543,1549

%N Nodes of degree 1 in graphs of XOR connected primes in successive intervals [2^i+1,2^(i+1)-1], i>=1.

%C The number used to produce the XOR couple is 2^i-2, with i sharing the index value of the initial interval and decremented in halved intervals down to 2.

%H Alois P. Heinz, <a href="/A200143/b200143.txt">Table of n, a(n) for n = 1..10000</a>

%e In the interval [17,31], i=4, the XOR couple number is 2^4-2=14. For half intervals it is 2^3-2 = 6, and the final application would be 2^2-2 = 2. All of the pairings can be represented as:

%e |-------XOR 14-------|

%e | |--------------| |

%e | | |--------| | |

%e | | | |--| | | |

%e 17 19 21 23 25 27 29 31

%e |-XOR 6-| |-XOR 6-|

%e | |--| | | |--| |

%e 17 19 21 23 25 27 29 31

%e XOR XOR XOR XOR

%e |2-| |2-| |2-| |2-|

%e 17 19 21 23 25 27 29 31

%e The prime XOR couples are (17,31), (19,29), (17,23), (17,19), (29,31) which produces the graph:

%e 17 19 23 29 31

%e 17 0 1 1 0 1 19

%e 19 1 0 0 1 0 / \

%e 23 1 0 0 0 0 or 23~17~31~29

%e 29 0 1 0 0 1

%e 31 1 0 0 1 0

%e Therefore 23 is the only node of degree 1 in the interval.

%p q:= (l, p, r)-> `if`(r-l=2, 0, `if`(isprime(l+r-p), 1, 0)+

%p `if`((l+r)/2>p, q(l, p, (l+r)/2), q((l+r)/2, p, r))):

%p a:= proc(n) local p, l;

%p p:= `if`(n=1, 1, a(n-1));

%p do p:= nextprime(p);

%p l:= 2^ilog2(p);

%p if q(l, p, l+l)=1 then break fi

%p od; a(n):=p

%p end:

%p seq(a(n), n=1..60); # _Alois P. Heinz_, Nov 15 2011

%t q[l_, p_, r_] := q[l, p, r] = If[r - l == 2, 0, If[PrimeQ[l + r - p], 1, 0] + If[(l + r)/2 > p, q[l, p, (l + r)/2], q[(l + r)/2, p, r]]];

%t a[n_] := a[n] = Module[{p, l}, p = If[n==1, 1, a[n-1]]; While[True, p = NextPrime[p]; l = 2^Floor@Log[2, p]; If[q[l, p, l+l]==1, Break[]]]; p];

%t Array[a, 60] (* _Jean-François Alcover_, Nov 12 2020, after _Alois P. Heinz_ *)

%Y Cf. A199824.

%K nonn

%O 1,1

%A _Brad Clardy_, Nov 14 2011

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 20 00:58 EDT 2024. Contains 371798 sequences. (Running on oeis4.)