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 A043312 #14 Jun 12 2019 02:55:02 %S A043312 1,2,3,4,5,6,7,64,66,67,68,69,70,71,128,129,131,132,133,134,135,192, %T A043312 193,194,196,197,198,199,256,257,258,259,261,262,263,320,321,322,323, %U A043312 324,326,327,384,385,386,387,388,389,391,448,449 %N A043312 a(n) = A033006(n)/9. %C A043312 Also: Numbers which, written in base 64, have only digits 0 through 7, and no two adjacent digits equal. - _M. F. Hasler_, Feb 03 2014 %H A043312 Robert Israel, <a href="/A043312/b043312.txt">Table of n, a(n) for n = 1..10000</a> %p A043312 f:= proc(n) local i; %p A043312 seq(64*n+i, i= subs(n mod 64 = NULL, [$0..7])) %p A043312 end proc: %p A043312 A:= $1..7: R:= [A]: %p A043312 for d from 2 to 3 do %p A043312 R:= map(f, R); %p A043312 A:= A, op(R); %p A043312 od: %p A043312 A; # _Robert Israel_, Jun 11 2019 %o A043312 (PARI) is_A043312(n)=(n=[n])&&!until(!n[1],((n=divrem(n[1],64))[2]<8 && n[1]%8!=n[2])||return) \\ _M. F. Hasler_, Feb 03 2014 %Y A043312 Cf. A043307 - A043320, A043291, A033001 - A033014, A033016 - A033029. %K A043312 nonn,base %O A043312 1,2 %A A043312 _Clark Kimberling_