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 A276948 #6 Sep 22 2016 21:28:20 %S A276948 2,1,1,2,2,1,1,2,2,1,1,1,1,1,1,1,1,2,2,1,1,2,2,1,1,2,2,1,1,1,1,1,1,1, %T A276948 1,2,2,1,1,2,2,1,1,2,2,1,1,1,1,1,1,1,1,2,2,1,1,2,2,1,1,2,2,1,1,1,1,1, %U A276948 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,2,1,1,2,2,1,1,2,2,1,1,1,1,1,1,1,1,2,2,1,1,2,2,1 %N A276948 First differences of A273670: a(n) = A273670(n) - A273670(n-1). %H A276948 Antti Karttunen, <a href="/A276948/b276948.txt">Table of n, a(n) for n = 1..5040</a> %H A276948 <a href="/index/Fa#facbase">Index entries for sequences related to factorial base representation</a> %F A276948 a(n) = A273670(n) - A273670(n-1). [Note that the indexing of A273670 begins from zero.] %o A276948 (Scheme) (define (A276948 n) (- (A273670 n) (A273670 (- n 1)))) %Y A276948 Cf. A273670. %Y A276948 Cf. also A276947, A276950, A276952. %K A276948 nonn,base %O A276948 1,1 %A A276948 _Antti Karttunen_, Sep 22 2016