0,4

(* using a Hofstadter-type (1,4) chaotic recurring sequence as a pattern*)

(* set of solved Markov matrices are used to reconstruct to sequential domain*)

(* using an average Matrix to bridge extremes on nonlinearity*)

(* the reconstruction is extended to 60 from 32 where the first "bad spot" happens*)

(* periodic "bad spots" that run for several matrices in a row exist*)

A[n_]:=If[(n<33||n>33)&&(n<42||n>45)&&(n<56||n>59), a[[n]].A[n-1], c[[32]].A[n-1]] A[0] = {{0, 1, 1, 2}, {1, 1, 2, 3}, {1, 2, 3, 4}, {2, 3, 4, 5}};

Clear[B, A, M, Hofstadter, ave] digits=60 Hofstadter[n_Integer?Positive] :=Hofstadter[n] =Hofstadter[n - Hofstadter[n-1]] + Hofstadter[n - Hofstadter[n-4]] Hofstadter[1] = Hofstadter[2] =1; Hofstadter[3] =2; Hofstadter[0]= 0; Hofstadter[4]= 3; n0=4 (* pattern matrices of the chaotic sequence*) A[k_]=Table[Hofstadter[k+i+j-2], {i, 1, n0}, {j, 1, n0}] M=Array[f, {n0, n0}] m1=Flatten[M] (* linear Markov matrix solutions *) a=Table[Flatten[M/.Solve[A[n]-M.A[n-1]==0, m1], 1], {n, 1, digits}]; (* function for average matrix calculation*) ave[n_Integer?Positive] :=ave[n] = (ave[n-1]*(n-1)+a[[n]])/n ave[1]=a[[1]]; c=Table[ave[n], {n, 1, 32}]; c[[32]] (* Martix reconstruction tensors skipping the "bad spots" by substitution of an average matrix*) B[n_]:=If[(n<33||n>33)&&(n<42||n>45)&&(n<56||n>59), a[[n]].B[n-1], c[[32]].B[n-1]] B[0] = {{0, 1, 1, 2}, {1, 1, 2, 3}, {1, 2, 3, 4}, {2, 3, 4, 5}}; (* output sequence of the reconstruction*) b=Flatten[Table[Floor[B[n][[1, 1]]], {n, 0, digits}]] ListPlot[b, PlotJoined->True, PlotRange->All]

Cf. A005185.

Sequence in context: A046108 A079411 A063882 this_sequence A005375 A138370 A125051

Adjacent sequences: A097870 A097871 A097872 this_sequence A097874 A097875 A097876

nonn,uned

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Sep 01 2004