is the link to "The SeqFan Archives" thread "Recursions in decimal expansions"
This thread discusses whether there is a generalization, which would allow to formulate the definitive rule for finding "Positive integers n such that the initial part of the decimal expansion of 1/n reveals a recursive sequence".
So this is the question, for which it would be interesting to find the answer.
P.S. The subject of interest for submitting this seq was to find such (and only such) positive integers, which decimal expansion INITIALLY reveals some algorithmically defined (and already known, thus easily visually recognizable) sequence (recursive or not) but THEN LATER (after some number of terms being revealed) such resemblance gets distorted (scrambled) and eventually goes away (fades, vanishes).
The follow up question, which was intriguing me was whether such resemblance is another incarnation of the Law of Small Numbers or whether such effect has deterministic origin.