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 A024649 #11 Aug 02 2025 06:26:02 %S A024649 0,1,2,3,4,5,6,7,70,71,72,73,74,75,76,77,760,761,762,763,764,765,766, %T A024649 767,7650,7651,7652,7653,7654,7655,7656,7657,76540,76541,76542,76543, %U A024649 76544,76545,76546,76547,765430,765431,765432,765433,765434,765435,765436 %N A024649 n written in fractional base 8/7. %C A024649 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 A024649 Amiram Eldar, <a href="/A024649/b024649.txt">Table of n, a(n) for n = 0..10000</a> %H A024649 <a href="/index/Ba#base_fractional">Index entries for sequences related to fractional bases</a>. %t A024649 a[n_] := a[n] = If[n == 0, 0, 10 * a[7 * Floor[n/8]] + Mod[n, 8]]; Array[a, 50, 0] (* _Amiram Eldar_, Aug 02 2025 *) %o A024649 (PARI) a(n) = if(n == 0, 0, 10 * a(n\8 * 7) + n % 8); \\ _Amiram Eldar_, Aug 02 2025 %Y A024649 Cf. A245336. %K A024649 nonn,base,easy %O A024649 0,3 %A A024649 _David W. Wilson_