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 A365369 #5 Sep 03 2023 10:41:53 %S A365369 1,1,1,4,2049,2,4,2049,3,26,6,4,2049,21,5,9,26,6,49,11,7,2049,21,8,14, %T A365369 24,9,26,16,10,29,49,11,19,54,12,2049,21,13,104,174,14,24,521,15,71, %U A365369 26,16,76,46,17,29,49,18,51,31,19,54,151,20,34,2049,21,99,36 %N A365369 A365368/5, except when A365368(n) = -1, then a(n) = -1. %o A365369 (Python) %o A365369 from fractions import Fraction %o A365369 def A365369(n): %o A365369 x = Fraction(n) %o A365369 while x.denominator > 1 or x<=n: %o A365369 x = Fraction(5*x.__round__(),3) %o A365369 return int(x)//5 %Y A365369 Cf. A087704, A087705, A087706, A087707, A087708, A087709, A365341, A365342, A365367, A365368. %K A365369 nonn %O A365369 1,4 %A A365369 _Chai Wah Wu_, Sep 02 2023