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”).
%I #23 Sep 08 2022 08:44:48
%S 1,10,89,1088,13617,157926,1763785,19470364,214326113,2357888642,
%T 25937324601,285311509560,3138428127889,34522711772638,
%U 379749833045417,4177248168656276,45949729862523585,505447028497873914
%N a(n) = 11^n - n^5.
%H Vincenzo Librandi, <a href="/A024132/b024132.txt">Table of n, a(n) for n = 0..300</a>
%H <a href="/index/Rec">Index entries for linear recurrences with constant coefficients</a>, signature (17,-81,185,-235,171,-67,11)
%F G.f.: ( -1 + 7*x - 200*x^3 - 715*x^4 - 279*x^5 - 12*x^6 ) / ( (11*x-1)*(x-1)^6 ). - _R. J. Mathar_, Apr 04 2011
%t Table[11^n-n^5,{n,0,20}] (* _Harvey P. Dale_, Apr 03 2011 *)
%o (Magma) [11^n-n^5: n in [0..50]]; // _Vincenzo Librandi_, Apr 04 2011
%o (PARI) a(n)=11^n-n^5 \\ _Charles R Greathouse IV_, Jul 01 2011
%K nonn,easy
%O 0,2
%A _N. J. A. Sloane_