cp's OEIS Frontend

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.

A282134 First differences of A045876.

Original entry on oeis.org

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, 11, 11, 11, -88, 11, 11, -22, 44, 11, 11, 11, 11, 11, -88, 11, 11, 11, -33, 55, 11, 11, 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
Offset: 1

Views

Author

Altug Alkan, Feb 06 2017

Keywords

Comments

See also scatterplot of this sequence.

Examples

			a(11) = 22 because A045876(12) - A045876(11) = (12 + 21) - 11 = 22.
		

Crossrefs

Cf. A045876.

Programs

  • Mathematica
    Differences@ Table[Total[FromDigits /@ Permutations@ IntegerDigits@ n], {n, 81}] (* Michael De Vlieger, Feb 07 2017, after T. D. Noe at A045876 *)
  • 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}
    a(n) = A045876(n+1) - A045876(n);

Formula

a(n) = A045876(n+1) - A045876(n).