This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A321421 #28 Aug 22 2020 16:18:01 %S A321421 1,11,51,211,851,3411,13651,54611,218451,873811,3495251,13981011, %T A321421 55924051,223696211,894784851,3579139411,14316557651,57266230611, %U A321421 229064922451,916259689811,3665038759251,14660155037011,58640620148051,234562480592211,938249922368851 %N A321421 a(n) = 10*(4^n - 1)/3 + 1. %H A321421 Colin Barker, <a href="/A321421/b321421.txt">Table of n, a(n) for n = 0..1000</a> %H A321421 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (5,-4). %F A321421 a(n) = 4*a(n-1) + 7, a(0) = 1 for n > 0. %F A321421 a(n) = 5*a(n-1) - 4*a(n-2), a(0) = 1, a(1) = 11, n > 1. %F A321421 a(n) = a(n-1) + 10*4^(n-1), a(0) = 1, n > 0. %F A321421 a(n) = A086462(n) + 1 for n > 0. - _Michel Marcus_, Nov 09 2018 %F A321421 G.f.: (1 + 6*x) / ((1 - x)*(1 - 4*x)). - _Colin Barker_, Nov 10 2018 %F A321421 E.g.f.: (-7*exp(x) + 10*exp(4*x))/3. - _Stefano Spezia_, Nov 10 2018 %F A321421 a(n) = 10*A002450(n) + 1. - _Omar E. Pol_, Nov 10 2018 %p A321421 seq(coeff(series((1+6*x)/((1-x)*(1-4*x)),x,n+1), x, n), n = 0 .. 25); # _Muniru A Asiru_, Nov 10 2018 %t A321421 a[n_]:=10*(4^n - 1)/3 + 1 ; Array[a, 20, 0] (* or *) %t A321421 CoefficientList[Series[-((7 E^x)/3) + (10 E^(4 x))/3 , {x, 0, 20}], x]*Table[n!, {n, 0, 20}] (* _Stefano Spezia_, Nov 10 2018 *) %t A321421 LinearRecurrence[{5,-4},{1,11},30] (* _Harvey P. Dale_, Aug 22 2020 *) %o A321421 (PARI) Vec((1 + 6*x) / ((1 - x)*(1 - 4*x)) + O(x^30)) \\ _Colin Barker_, Nov 10 2018 %o A321421 (GAP) List([0..25],n->10*(4^n-1)/3+1); # _Muniru A Asiru_, Nov 10 2018 %Y A321421 Cf. A000302, A002450, A010727. %K A321421 nonn,easy %O A321421 0,2 %A A321421 _Paul Curtz_, Nov 09 2018 %E A321421 More terms from _Colin Barker_, Nov 10 2018