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 A024633 #15 Jul 31 2025 03:51:14 %S A024633 0,1,2,3,4,30,31,32,33,34,310,311,312,313,314,340,341,342,343,344, %T A024633 3120,3121,3122,3123,3124,3400,3401,3402,3403,3404,3430,3431,3432, %U A024633 3433,3434,31210,31211,31212,31213,31214,31240,31241,31242,31243,31244,34020,34021 %N A024633 n written in fractional base 5/3. %C A024633 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 A024633 Amiram Eldar, <a href="/A024633/b024633.txt">Table of n, a(n) for n = 0..10000</a> %H A024633 <a href="/index/Ba#base_fractional">Index entries for sequences related to fractional bases</a>. %t A024633 a[n_] := a[n] = If[n == 0, 0, 10 * a[3 * Floor[n/5]] + Mod[n, 5]]; Array[a, 50, 0] (* _Amiram Eldar_, Jul 30 2025 *) %o A024633 (PARI) a(n) = if(n == 0, 0, 10 * a(n\5 * 3) + n % 5); \\ _Amiram Eldar_, Jul 30 2025 %Y A024633 Cf. A245343. %K A024633 nonn,base,easy %O A024633 0,3 %A A024633 _David W. Wilson_