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 #18 Aug 03 2024 17:00:35
%S 1,2,16,170,1696,15962,144496,1273610,11012416,93864122,791266576,
%T 6612607850,54878189536,452866803482,3719823438256,30436810578890,
%U 248242046141056,2019169299698042,16385984911571536,132716292890482730,1073129238309234976,8664826172771491802
%N a(n) = 8^n - 7^n + 1.
%H Paolo Xausa, <a href="/A155659/b155659.txt">Table of n, a(n) for n = 0..1000</a>
%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (16,-71,56).
%F G.f.: 1/(1-8*x)-1/(1-7*x)+1/(1-x).
%F E.g.f.: exp(8*x)-exp(7*x)+exp(x).
%F a(n) = 15*a(n-1)-56*a(n-2)+42 with a(0) = 1, a(1) = 2. - _Vincenzo Librandi_, Jul 21 2010
%t Table[8^n - 7^n + 1, {n, 0, 25}] (* _Paolo Xausa_, Aug 03 2024 *)
%o (PARI) a(n)=8^n-7^n+1 \\ _Charles R Greathouse IV_, Jun 11 2015
%Y Cf. A155638, A155639, A155640, A155641, A155642, A155643, A155644, A155645, A155646, A155647, A155648, A155649, A155650, A155651, A155652, A155653, A155654, A155655, A155656, A155657, A155658.
%K nonn,easy
%O 0,2
%A _Mohammad K. Azarian_, Jan 31 2009