A048709 -id:A048709 - cp's OEIS frontend

A048705 The rule numbers for 1-D CA composed of Rules "90" and "150" so that each direction occurs only once.

90, 150, 1721342310, 140117185019831836588493434554119984790, 113427455640312821160607117168492587690

Offset: 1

Antti Karttunen, Mar 09 1999

nonn

The "numerator" (0, 1 and the rest from A020652) is the multiplicity of the "Rule 150" component and the "denominator" (1, 0 and the rest from A020653) is the multiplicity of the "Rule 90" component.
The resulting numbers define one-dimensional linear cellular automata with radius being the sum of the number of the "90" and "150" components.
In hexadecimal the sequence is 5A, 96, 66999966, 69699696969669699696696969699696, 5555555555555555AAAAAAAAAAAAAAAA, ...

Index entries for sequences related to cellular automata

A048706 gives the corresponding "XOR-conjugate" rules.

Cf. A038183, A038184, A048709 (for specific examples). See also A048708, A048720.

# The definitions of bit_i and floor_log_2 are given in A048700
rule90 := proc(seed,n) option remember: local sl, i: if (0 = n) then (seed) else sl := floor_log_2(seed+1); add(((bit_i(rule90(seed,n-1),i)+bit_i(rule90(seed,n-1),i-2)) mod 2)*(2^i), i=0..(2*n)+sl) fi: end:
rule150 := proc(seed,n) option remember: local sl, i: if (0 = n) then (seed) else sl := floor_log_2(seed+1);
add(((bit_i(rule150(seed,n-1),i)+bit_i(rule150(seed,n-1),i-1)+bit_i(rule150(seed,n-1),i-2)) mod 2)*(2^i), i=0..((2*n)+sl)) fi: end:
# Rule 90 and Rule 150 are commutative in respect to each other:
rule90x150combination := proc(n) local p,q,i; p := extended_A020652[ n ]; # the Rule 150 component [ 0,1,op(A020652) ]
q := extended_A020653[ n ]; # the Rule 90 component [ 1,0,op(A020653) ]
RETURN(sum('bit_i(rule150(rule90(i,q),p),(2*(p+q))) * (2^i)','i'=0..(2^((2*(p+q))+1))-1));
end:

a(n) = rule90x150combination(n) # See the Maple procedures below.

A048710 Family 1 "Rule 90 x Rule 150 Array" read by antidiagonals.

Original entry on oeis.org

1, 5, 7, 17, 27, 21, 85, 119, 65, 107, 257, 427, 325, 455, 273, 1285, 1799, 1105, 1755, 1365, 1911, 4369, 6939, 5397, 7607, 4097, 6827, 5189, 21845, 30583, 16705, 27499, 20485, 28679, 17745, 28123, 65537

Offset: 0

Antti Karttunen, Mar 18 1999

Infinitely many one-dimensional cellular automaton rules (given in sequence A048705) occur in this array, as combinations of CA-rules "90" (generates rows) and "150" (generates columns).
No pattern occurs twice in such arrays.
Each row/column can be generated from its predecessor row/column with SHIFTXORADJ transformation, given in A048711.

			   1  5  17   85  257 1105 ... [ beginning of array ]
   7 27 119  427 1799 ...
  21 65 325 1105 5397 ...

Rows = A038183, A048711, A048713, columns = A038184, A048712, A048713, diagonal = A048709. Cf. A048720.

trinv := n -> floor((1+sqrt(1+8*n))/2); # Gives integral inverses of the triangular numbers

a(n) = rule150(rule90(1, (((trinv(n)-1)*(((1/2)*trinv(n))+1))-n)), (n-((trinv(n)*(trinv(n)-1))/2))).

cp's OEIS Frontend

A048705 The rule numbers for 1-D CA composed of Rules "90" and "150" so that each direction occurs only once.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Formula