|
| |
|
|
A292680
|
|
Rule 6: 000, ..., 111 -> 0, 1, 1, 0, 0, 0, 0, 0.
|
|
4
|
|
|
|
0, 6, 12, 8, 24, 26, 16, 16, 48, 54, 52, 48, 32, 34, 32, 32, 96, 102, 108, 104, 104, 106, 96, 96, 64, 70, 68, 64, 64, 66, 64, 64, 192, 198, 204, 200, 216, 218, 208, 208, 208, 214, 212, 208, 192, 194, 192, 192, 128, 134, 140, 136, 136, 138, 128, 128, 128, 134, 132, 128
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,2
|
|
|
COMMENTS
|
The orbit of 1 under this rule is A266180.
Rule 6 is the smallest rule which is even (otherwise infinitely many bits would be switched on at step 1, for any finite starting value) and nontrivial (i.e., does not lead to extinction nor simple reproduction, possibly shifted left or right, of a single-bit initial state).
As is customary in the context of elementary cellular automata, the result is the bitmap obtained from the argument extended by one bit to the right (as to consider the cell which has bit 0 of the input as left neighbor), cf. example. Since the rule has a value < 16, no cell having its left neighbor 'on' will be on. Therefore all values a(n) are even. See A292681 for the variant without this extension beyond bit 0, i.e., a(n)/2.
|
|
|
LINKS
|
|
|
|
EXAMPLE
|
n | a(n)
0 = 0[2] | 0[2] = 0
1 = 1[2] | 110[2] = 6 (bits below 001 and 010 are on, below 100 is off)
2 = 10[2] | 1100[2] = 12 (as above, plus an additional bit 0 below 000)
3 = 11[2] | 1000[2] = 8 (1 below 001, 0 below 011, 110 and 100.)
4 = 100[2] | 11000[2] = 24 (as n = 1 and n = 2, shifted right once more)
5 = 101[2] | 11010[2] = 26 (1 below 001 and 010 (twice), 0 below 101 and 100)
6 = 110[2] | 10000[2] = 16 (as n = 3, shifted right once)
7 = 111[2] | 10000[2] = 16 (1 below 001, 0 below 011, 111, 110 and 100).
|
|
|
PROG
|
(PARI) apply( A292680(n, r=6)=sum(i=0, logint(!n+n<<=2, 2)+1, bittest(r, (n>>i)%8)<<i), [0..30])
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,easy,base
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
