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 A265411 #5 Dec 13 2015 07:55:39 %S A265411 1,7,3,3,1,3,1,3,1,1,3,1,1,3,1,1,1,3,1,1,1,3,1,1,1,1,3,1,1,1,1,3,1,1, %T A265411 1,1,1,3,1,1,1,1,1,3,1,1,1,1,1,1,3,1,1,1,1,1,1,3,1,1,1,1,1,1,1,3,1,1, %U A265411 1,1,1,1,1,3,1,1,1,1,1,1,1,1,3,1,1,1,1,1,1,1,1,3,1,1,1,1,1,1,1,1,1,3 %N A265411 a(0) = 1, a(1) = 7, otherwise, if A240025(n-1) = 1 [when n is in A033638] a(n) = 3, otherwise a(n) = 1. %C A265411 Each n occurs a(n) times in A265410. %H A265411 Antti Karttunen, <a href="/A265411/b265411.txt">Table of n, a(n) for n = 0..10001</a> %F A265411 a(0) = 1, a(1) = 7, otherwise, if A240025(n-1) = 1 [when n is in A033638] a(n) = 3, otherwise a(n) = 1. %o A265411 (Scheme) (define (A265411 n) (cond ((zero? n) 1) ((= 1 n) 7) ((= 1 (A240025 (- n 1))) 3) (else 1))) %Y A265411 Cf. A033638, A240025. %Y A265411 Cf. A265410, A265412 (partial sums). %K A265411 nonn %O A265411 0,2 %A A265411 _Antti Karttunen_, Dec 09 2015