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 A271590 #11 Apr 15 2016 14:47:39 %S A271590 3,4,2,3,4,11,1,2,4,2,3,4,12,26,3,4,2,1,2,4,11,1,2,4,2,3,4,12,36,71,3, %T A271590 4,2,3,4,11,1,2,4,2,1,2,4,12,26,3,4,2,1,2,4,11,1,2,4,2,3,4,12,36,108, %U A271590 206,3,4,2,3,4,11,1,2,4,2,3,4,12,26,3,4,2,1 %N A271590 First differences of column n of A271589 for arbitrarily large n. %H A271590 Max Barrentine, <a href="/A271590/b271590.txt">Table of n, a(n) for n = 1..16368</a> %F A271590 For all k>2: %F A271590 a(A000295(k)) = a(A000295(k+1)) = 3; %F A271590 For A000295(k)<n<2^k-2, a(n) = a(n+2^k-1) = a(n+2^(k+1)-1); %F A271590 For n = 2^k-2, a(n) = a(n+2^(k+1)-1), a(2^(k+1)-2) = a(n)+5*3^(k-2); %F A271590 a(2^(k+1)-3) = 4*3^(k-2); %F A271590 For 2^k-2<n<A079583(k-1)-1, a(n) = a(n+2^k)=a(n+2^(k+1)-1); %F A271590 For n = A079583(k-1)-1, a(n) = a(n+2^(k+1)-1) = 1; %F A271590 For n = A079583(k-1), a(n) = a(n+2^(k+1)-1) = 2; %F A271590 a(A079583(k-1)+2^k-1) = 3; %F A271590 For A079583(k-1)<n<A000295(k+1), a(n) = a(n+2^k-1) = a(n+2^(k+1)-1) %Y A271590 Cf. A271589. %Y A271590 Cf. A000295, A079583. %K A271590 nonn %O A271590 1,1 %A A271590 _Max Barrentine_, Apr 10 2016