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 A024645 #11 Aug 02 2025 06:25:53 %S A024645 0,1,2,3,4,5,6,7,30,31,32,33,34,35,36,37,60,61,62,63,64,65,66,67,310, %T A024645 311,312,313,314,315,316,317,340,341,342,343,344,345,346,347,370,371, %U A024645 372,373,374,375,376,377,620,621,622,623,624,625,626,627,650,651,652,653,654,655 %N A024645 n written in fractional base 8/3. %C A024645 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 A024645 Amiram Eldar, <a href="/A024645/b024645.txt">Table of n, a(n) for n = 0..10000</a> %H A024645 <a href="/index/Ba#base_fractional">Index entries for sequences related to fractional bases</a>. %t A024645 a[n_] := a[n] = If[n == 0, 0, 10 * a[3 * Floor[n/8]] + Mod[n, 8]]; Array[a, 50, 0] (* _Amiram Eldar_, Aug 02 2025 *) %o A024645 (PARI) a(n) = if(n == 0, 0, 10 * a(n\8 * 3) + n % 8); \\ _Amiram Eldar_, Aug 02 2025 %Y A024645 Cf. A245347. %K A024645 nonn,base,easy %O A024645 0,3 %A A024645 _David W. Wilson_