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 A024662 #11 Aug 04 2025 02:17:16 %S A024662 0,1,2,3,4,5,6,7,8,9,70,71,72,73,74,75,76,77,78,79,740,741,742,743, %T A024662 744,745,746,747,748,749,7410,7411,7412,7413,7414,7415,7416,7417,7418, %U A024662 7419,7480,7481,7482,7483,7484,7485,7486,7487,7488,7489,74150,74151,74152 %N A024662 n written in fractional base 10/7. %C A024662 To represent a number in base b, if a digit exceeds b-1, subtract b and carry 1. In fractional base a/b, subtract a and carry b. %H A024662 Amiram Eldar, <a href="/A024662/b024662.txt">Table of n, a(n) for n = 0..10000</a> %H A024662 <a href="/index/Ba#base_fractional">Index entries for sequences related to fractional bases</a>. %t A024662 a[n_] := a[n] = If[n == 0, 0, 10 * a[7 * Floor[n/10]] + Mod[n, 10]]; Array[a, 50, 0] (* _Amiram Eldar_, Aug 04 2025 *) %o A024662 (PARI) a(n) = if(n == 0, 0, 10 * a(n\10 * 7) + n % 10); \\ _Amiram Eldar_, Aug 04 2025 %Y A024662 Cf. A245351. %K A024662 nonn,base,easy %O A024662 0,3 %A A024662 _David W. Wilson_