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 A214678 #20 Feb 16 2025 08:33:18 %S A214678 1,2,3,4,5,6,7,8,11,12,13,14,15,16,17,18,21,22,23,24,25,26,27,28,31, %T A214678 32,33,34,35,36,37,38,41,42,43,44,45,46,47,48,51,52,53,54,55,56,57,58, %U A214678 61,62,63,64,65,66,67,68,71,72,73,74,75,76,77,78,81,82,83 %N A214678 a(n) = n represented in bijective base-8 numeration. %H A214678 Alois P. Heinz, <a href="/A214678/b214678.txt">Table of n, a(n) for n = 1..10000</a> %H A214678 R. R. Forslund, <a href="http://www.emis.de/journals/SWJPAM/Vol1_1995/rrf01.ps">A logical alternative to the existing positional number system</a>, Southwest Journal of Pure and Applied Mathematics, Vol. 1, 1995, 27-29. %H A214678 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Zerofree.html">Zerofree</a> %H A214678 Wikipedia, <a href="https://en.wikipedia.org/wiki/Bijective_numeration">Bijective numeration</a> %p A214678 a:= proc(n) local d, l, m; m:= n; l:= NULL; %p A214678 while m>0 do d:= irem(m, 8, 'm'); %p A214678 if d=0 then d:=8; m:= m-1 fi; %p A214678 l:= d, l %p A214678 od; parse(cat(l)) %p A214678 end: %p A214678 seq(a(n), n=1..100); %t A214678 With[{b = 8}, Flatten@ Table[FromDigits[PadLeft[IntegerDigits[k, b], n] /. k_ :> k + 1], {n, 3}, {k, 0, b^n - 1}] ] (* _Michael De Vlieger_, Sep 16 2023 *) %Y A214678 Column k=8 of A214676. %K A214678 nonn,base,easy %O A214678 1,2 %A A214678 _Alois P. Heinz_, Jul 25 2012