|
Search: id:A101290
|
|
|
| A101290 |
|
Dissipation time for n under the following scheme: set f(0)=n, f(i)=0 for all i<>0, then iterate the evolutionary process by which f(i) is replaced by floor[(f(i-1)+f(i)+f(i+1))/3] for all i, with all calculations done in parallel. a(n) is the minimum number of iterations of this process required to reach f(i)=0 for all i, for n=0,1,2,3,... |
|
+0
1
|
|
| 0, 1, 1, 3, 3, 3, 5, 5, 5, 7, 7, 7, 7, 7, 7, 9, 9, 9, 11, 11, 11, 11, 11, 11, 12, 12, 12, 14, 14, 14, 14, 14, 14, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16, 16, 18, 18, 18, 19, 19, 19, 19, 19, 19, 20, 20, 20, 20, 20, 20, 22, 22, 22, 23, 23, 23, 23, 23, 23, 25, 25, 25, 25, 25, 25
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
EXAMPLE
|
If n=10, the process evolves as follows on [ -3,3], showing that a(10)=7:
Start with: 0,0,0,10,0,0,0
Iteration 1: 0,0,3,3,3,0,0
Iteration 2: 0,1,2,3,2,1,0
Iteration 3: 0,1,2,2,2,1,0
Iteration 4: 0,1,1,2,1,1,0
Iteration 5: 0,0,1,1,1,0,0
Iteration 6: 0,0,0,1,0,0,0
Iteration 7: 0,0,0,0,0,0,0
|
|
CROSSREFS
|
Sequence in context: A126661 A001650 A130175 this_sequence A080605 A130823 A101435
Adjacent sequences: A101287 A101288 A101289 this_sequence A101291 A101292 A101293
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
John W. Layman (layman(AT)math.vt.edu), Dec 21 2004
|
|
|
Search completed in 0.002 seconds
|
