login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A014881 a(1)=1, a(n) = 11*a(n-1)+n. 3
1, 13, 146, 1610, 17715, 194871, 2143588, 23579476, 259374245, 2853116705, 31384283766, 345227121438, 3797498335831, 41772481694155, 459497298635720, 5054470284992936, 55599173134922313, 611590904484145461, 6727499949325600090 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = -11/100 + 11/100*11^n - 1/10*n, with n>=1. - Paolo P. Lava, Jan 14 2009
a(n) = 13*a(n-1)-23*a(n-2)+11*a(n-3), with a(1)=1, a(2)=13, a(3)=146. - Vincenzo Librandi, Oct 20 2012
G.f.: x/((1-11*x)*(1-x)^2). - Jinyuan Wang, Mar 11 2020
MAPLE
a:=n->sum(11^(n-j)*j, j=0..n): seq(a(n), n=1..17); # Zerinvary Lajos, Jun 05 2008
a:= n-> (Matrix([[1, 0, 1], [1, 1, 1], [0, 0, 11]])^n)[2, 3]:
seq(a(n), n=1..17); # Alois P. Heinz, Aug 06 2008
MATHEMATICA
LinearRecurrence[{13, -23, 11}, {1, 13, 146}, 20] (* Vincenzo Librandi, Oct 20 2012 *)
PROG
(Magma) I:=[1, 13, 146]; [n le 3 select I[n] else 13*Self(n-1) - 23*Self(n-2)+ 11*Self(n-3): n in [1..20]]; // Vincenzo Librandi, Oct 20 2012
CROSSREFS
Sequence in context: A297223 A199023 A152585 * A048442 A353107 A051524
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 17:32 EST 2023. Contains 367659 sequences. (Running on oeis4.)