A010880 a(n) = n mod 11.

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 0

Offset

0,3

Links

Table of n, a(n) for n=0..77.

Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,0,0,0,0,0,1).

Formula

From Hieronymus Fischer, Sep 30 2007: (Start)

a(n) = (1/11)*(1-r^n)*sum{1<=k<11, k*product{1<=m<11,m<>k, (1-r^(n-m))}} where r=exp(2*Pi/11*i) and i=sqrt(-1).

a(n) = (1024/11)^2*(sin(n*Pi/11))^2*sum{1<=k<11, k*product{1<=m<11,m<>k, (sin((n-m)*Pi/11))^2}}.

G.f.: (sum{1<=k<11, k*x^k})/(1-x^11).

G.f.: x*(10*x^11-11*x^10+1)/((1-x^11)*(1-x)^2). (End)

Mathematica

PadRight[{}, 80, Range[0, 10]] (* Harvey P. Dale, Nov 13 2012 *)

Prog

(Sage) [power_mod(n, 11, 11) for n in range(0, 78)] # Zerinvary Lajos, Nov 07 2009
(PARI) a(n)=n%11 \\ Charles R Greathouse IV, Oct 07 2015

Crossrefs

Partial sums: A130489. Other related sequences A130481, A130482, A130483, A130484, A130485, A130486, A130487, A130488.

Sequence in context: A297235 A090175 A275010 * A261424 A097462 A210944

Adjacent sequences: A010877 A010878 A010879 * A010881 A010882 A010883

Keyword

nonn,easy

Author

N. J. A. Sloane.

Extensions

More terms from Correction. Typo at the sum formula for the g.f.: the summation index should not read "1<=k<10" but "1<=k<11" (see corrected formula).

Status

approved