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 A024652 #11 Aug 02 2025 06:26:09 %S A024652 0,1,2,3,4,5,6,7,8,40,41,42,43,44,45,46,47,48,80,81,82,83,84,85,86,87, %T A024652 88,430,431,432,433,434,435,436,437,438,470,471,472,473,474,475,476, %U A024652 477,478,820,821,822,823,824,825,826,827,828,860,861,862,863,864,865,866,867,868 %N A024652 n written in fractional base 9/4. %C A024652 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 A024652 Amiram Eldar, <a href="/A024652/b024652.txt">Table of n, a(n) for n = 0..10000</a> %H A024652 <a href="/index/Ba#base_fractional">Index entries for sequences related to fractional bases</a>. %t A024652 a[n_] := a[n] = If[n == 0, 0, 10 * a[4 * Floor[n/9]] + Mod[n, 9]]; Array[a, 50, 0] (* _Amiram Eldar_, Aug 02 2025 *) %o A024652 (PARI) a(n) = if(n == 0, 0, 10 * a(n\9 * 4) + n % 9); \\ _Amiram Eldar_, Aug 02 2025 %Y A024652 Cf. A245350. %K A024652 nonn,base,easy %O A024652 0,3 %A A024652 _David W. Wilson_