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 A085193 #10 Jan 13 2024 10:53:06 %S A085193 2,6,2,4,18,2,6,2,4,10,2,4,8,58,2,6,2,4,18,2,6,2,4,10,2,4,8,26,2,6,2, %T A085193 4,10,2,4,8,18,2,4,8,16,202,2,6,2,4,18,2,6,2,4,10,2,4,8,58,2,6,2,4,18, %U A085193 2,6,2,4,10,2,4,8,26,2,6,2,4,10,2,4,8,18,2,4,8,16,74,2,6,2,4,18,2,6,2,4,10 %N A085193 Repeating part of A085192. %H A085193 Antti Karttunen, <a href="/A080237/a080237tree.txt">Notes concerning A080237-tree and related sequences</a>. %F A085193 a(n) = A085192(A081291(n+1)-1). %F A085193 a(n) = 4*A085193(A085182(n+1)-1) + 2 - (2^A007001(n+1)) if A007001(n+2)==1, otherwise 2^A007001(n+1). %o A085193 (MIT/GNU Scheme) (define (A085193 nn) (let ((n (1+ nn))) (cond ((= 1 (A007001 (+ n 1))) (- (* 4 (A085193 (-1+ (A085182 n)))) (- (expt 2 (A007001 n)) 2))) (else (expt 2 (A007001 n)))))) %Y A085193 Same sequence divided by 2: A085194. Cf. A085190. %K A085193 nonn %O A085193 0,1 %A A085193 _Antti Karttunen_, Jun 14 2003