Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A055017
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A055017 Difference between sums of alternate digits of n starting with the last, i.e. (Sum of ultimate digit of n, antepenultimate digit of n,...)-(sum of penultimate digit of n, preantepenultimate digit of n,...). +0
9
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, -2, -1, 0, 1, 2, 3, 4, 5, 6, 7, -3, -2, -1, 0, 1, 2, 3, 4, 5, 6, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5, -5, -4, -3, -2, -1, 0, 1, 2, 3, 4, -6, -5, -4, -3, -2, -1, 0, 1, 2, 3, -7, -6, -5, -4, -3, -2, -1, 0, 1, 2, -8, -7, -6, -5, -4, -3 (list; graph; listen)
OFFSET

0,3

COMMENT

n is divisible by 11 iff a(n) is a multiple of 11

Digital sum with alternating signs starting with a positive sign for the rightmost digit. - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jun 18 2007

For n<100 equal to (n mod 10 - floor(n/10)) = -A076313(n). - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jun 18 2007

FORMULA

a(n)=n+11*sum{k>0,(-1)^k*floor(n/10^k)}. - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jun 18 2007

a(10n+k)=k-a(n), 0<=k<10. - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jun 18 2007

G.f. g(x)=sum{k>0, (x^k-x^(k+10^k)+(-1)^k*11*x^(10^k))/(1-x^(10^k))}/(1-x). - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jun 18 2007

a(n)=n+11*sum{10<=k<=n, sum{j|k,j>=10, (-1)^floor(log_10(j))*(floor(log_10(j))-floor(log_10(j-1)))}}. - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jun 18 2007

G.f. expressed in terms of Lambert series: g(x)=(x/(1-x)+11*L[b(k)](x))/(1-x) where L[b(k)](x)=sum{k>=0, b(k)*x^k/(1-x^k)} is a Lambert series with b(k)=(-1)^floor(log_10(k)), if k>1 is a power of 10, else b(k)=0. - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jun 25, 2007

G.f.: g(x)=sum{k>0, (1+11*c(k))*x^k}/(1-x), where c(k)=sum{j>1,j|k, (-1)^floor(log_10(j))*(floor(log_10(j))-floor(log_10(j-1)))}. - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jun 25, 2007

EXAMPLE

a(123)=3-2+1=2, a(9875)=5-7+8-9=-3.

CROSSREFS

Unsigned version differs from A040114 and A040115 when n=100 and from A040997 when n=101.

Cf. A076313, A076314, A007953, A003132.

Sequence in context: A007376 A001073 A076313 this_sequence A040997 A075877 A133500

Adjacent sequences: A055014 A055015 A055016 this_sequence A055018 A055019 A055020

KEYWORD

base,easy,sign

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), May 31 2000

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research