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 A024656 #11 Aug 04 2025 02:16:59 %S A024656 0,1,2,3,4,5,6,7,8,80,81,82,83,84,85,86,87,88,870,871,872,873,874,875, %T A024656 876,877,878,8760,8761,8762,8763,8764,8765,8766,8767,8768,87650,87651, %U A024656 87652,87653,87654,87655,87656,87657,87658,876540,876541,876542,876543 %N A024656 n written in fractional base 9/8. %C A024656 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 A024656 Amiram Eldar, <a href="/A024656/b024656.txt">Table of n, a(n) for n = 0..10000</a> %H A024656 <a href="/index/Ba#base_fractional">Index entries for sequences related to fractional bases</a>. %t A024656 a[n_] := a[n] = If[n == 0, 0, 10 * a[8 * Floor[n/9]] + Mod[n, 9]]; Array[a, 50, 0] (* _Amiram Eldar_, Aug 04 2025 *) %o A024656 (PARI) a(n) = if(n == 0, 0, 10 * a(n\9 * 8) + n % 9); \\ _Amiram Eldar_, Aug 04 2025 %Y A024656 Cf. A245338. %K A024656 nonn,base,easy %O A024656 0,3 %A A024656 _David W. Wilson_