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 A282134 #11 Feb 07 2017 17:54:52
%S A282134 1,1,1,1,1,1,1,1,2,0,22,11,11,11,11,11,11,11,-88,11,-11,33,11,11,11,
%T A282134 11,11,11,-88,11,11,-22,44,11,11,11,11,11,-88,11,11,11,-33,55,11,11,
%U A282134 11,11,-88,11,11,11,11,-44,66,11,11,11,-88,11,11,11,11,11,-55,77,11,11,-88,11,11,11,11,11,11,-66,88,11,-88,11
%N A282134 First differences of A045876.
%C A282134 See also scatterplot of this sequence.
%H A282134 Altug Alkan, <a href="/A282134/b282134.txt">Table of n, a(n) for n = 1..10000</a>
%F A282134 a(n) = A045876(n+1) - A045876(n).
%e A282134 a(11) = 22 because A045876(12) - A045876(11) = (12 + 21) - 11 = 22.
%t A282134 Differences@ Table[Total[FromDigits /@ Permutations@ IntegerDigits@ n], {n, 81}] (* _Michael De Vlieger_, Feb 07 2017, after _T. D. Noe_ at A045876 *)
%o A282134 (PARI) A045876(n) = {my(d=digits(n), q=1, v, t=1); v = vecsort(d); for(i=1, #v-1, if(v[i]==v[i+1], t++, q*=binomial(i, t); t=1)); q*binomial(#v, t)*(10^#d-1)*vecsum(d)/9/#d}
%o A282134 a(n) = A045876(n+1) - A045876(n);
%Y A282134 Cf. A045876.
%K A282134 base,easy,sign
%O A282134 1,9
%A A282134 _Altug Alkan_, Feb 06 2017