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!)
A327972 Bitwise XOR of trajectories of rule 30 and rule 150, when both are started from a lone 1 cell: a(n) = A110240(n) XOR A038184(n). 7

%I #38 Mar 07 2023 07:42:37

%S 0,0,12,4,128,384,3404,740,37056,127296,794316,286532,8510656,

%T 25560896,224057484,42076324,2446214016,8430013568,51732969356,

%U 18062215300,553213409792,1655549411840,14630859361996,3227756349540,159219183713088,546944274202816,3411332163636556,1231354981057220,36554500089286208,109782277571646400,962314238681316620

%N Bitwise XOR of trajectories of rule 30 and rule 150, when both are started from a lone 1 cell: a(n) = A110240(n) XOR A038184(n).

%H Antti Karttunen, <a href="/A327972/b327972.txt">Table of n, a(n) for n = 0..1023</a>

%H Antti Karttunen, <a href="/A327972/a327972.png">Terms up to a(255) drawn as binary strings, with 1 bit = 3x3 pixels resolution</a>

%H Antti Karttunen, <a href="/A327972/a327972_1.png">Terms up to a(1023) drawn as binary strings, with 1 bit = 1 pixel resolution</a>

%H <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>

%H <a href="/index/Ce#cell">Index entries for sequences related to cellular automata</a>

%H <a href="/index/Ge#GF2X">Index entries for sequences operating on GF(2)[X]-polynomials</a>

%F a(n) = A038184(n) XOR A110240(n).

%F Conjecture: for n > 1, floor(log_2(a(n))) = 2*n - (1,2,1,4,1,2,1,5 according as n == 0..7 (mod 8), respectively). - _Alan Michael Gómez Calderón_, Mar 02 2023

%o (PARI)

%o A048727(n) = bitxor(n, bitxor(2*n, 4*n)); \\ From A048727

%o A038184(n) = if(!n,1,A048727(A038184(n-1)));

%o A269160(n) = bitxor(n, bitor(2*n, 4*n)); \\ From A269160.

%o A110240(n) = if(!n,1,A269160(A110240(n-1)));

%o A327972(n) = bitxor(A038184(n), A110240(n));

%o \\ Use this one for writing b-files:

%o A327972write(up_to) = { my(s1=1, s2=1); for(n=0,up_to, write("b327972.txt", n, " ", bitxor(s1, s2)); s1 = A048727(s1); s2 = A269160(s2)); };

%o (Python)

%o def A048727(n): return(n^(n<<1)^(n<<2))

%o def A269160(n): return(n^((n<<1)|(n<<2)))

%o def genA327972():

%o '''Yield successive terms of A327972.'''

%o s1 = 1

%o s2 = 1

%o while True:

%o yield (s1^s2)

%o s1 = A269160(s1)

%o s2 = A048727(s2)

%Y Cf. A003987, A038184, A048727, A110240, A269160.

%Y Cf. also A327971, A327973, A327976, A328103, A328104 for other such combinations.

%K nonn

%O 0,3

%A _Antti Karttunen_, Oct 03 2019

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 26 21:39 EDT 2024. Contains 372004 sequences. (Running on oeis4.)