This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A070981 #10 Jun 12 2019 12:56:33
%S A070981 1,3,4,5,6,13,7,14,8,21,16,21,9,13,20,22,10,32,17,21,13,51,11,67,37,
%T A070981 66,65,14,69,21,12,68,16,35,20,66,15,122,65,22,98,13,70,66,20,117,28,
%U A070981 67,58,37,34,66,151,103,93,14,240,80,18,21,79,87,20,68,114,66,28,35,155
%N A070981 Smallest integer k such that n divides floor((4/3)^k).
%H A070981 Harvey P. Dale, <a href="/A070981/b070981.txt">Table of n, a(n) for n = 1..1000</a>
%F A070981 a(n) = min( k : A064628(k) == 0 mod(n) )
%t A070981 sik[n_]:=Module[{k=1},While[Mod[Floor[(4/3)^k],n]!=0,k++];k]; Array[sik,70] (* _Harvey P. Dale_, Jun 12 2019 *)
%o A070981 (PARI) for(n=1,100,s=1; while(floor((4/3)^s)%n>0,s++); print1(s,","))
%Y A070981 Cf. A064628.
%K A070981 easy,nonn
%O A070981 1,2
%A A070981 _Benoit Cloitre_, May 24 2002