[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A282134
First differences of A045876.
1
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
(list; graph; refs; listen; history; text; internal format)
OFFSET
1,9
COMMENTS
See also scatterplot of this sequence.
LINKS
Altug Alkan, Table of n, a(n) for n = 1..10000
FORMULA
a(n) = A045876(n+1) - A045876(n).
EXAMPLE
a(11) = 22 because A045876(12) - A045876(11) = (12 + 21) - 11 = 22.
MATHEMATICA
Differences@ Table[Total[FromDigits /@ Permutations@ IntegerDigits@ n], {n, 81}] (* Michael De Vlieger, Feb 07 2017, after T. D. Noe at A045876 *)
PROG
(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);
CROSSREFS
Cf. A045876.
Sequence in context: A290465 A256303 A156438 * A293938 A254042 A368014
Adjacent sequences: A282131 A282132 A282133 * A282135 A282136 A282137
KEYWORD
base,easy,sign
AUTHOR
Altug Alkan, Feb 06 2017
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified December 13 19:16 EST 2024. Contains 378729 sequences.
License Agreements, Terms of Use, Privacy Policy