cp's OEIS Frontend

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.

A188716 a(n) = n + (n-1)*(2^n-2).

This page as a plain text file.
%I A188716 #58 Aug 04 2024 11:02:35
%S A188716 1,1,4,15,46,125,316,763,1786,4089,9208,20471,45046,98293,212980,
%T A188716 458739,983026,2097137,4456432,9437167,19922926,41943021,88080364,
%U A188716 184549355,385875946,805306345,1677721576,3489660903,7247757286,15032385509,31138512868,64424509411,133143986146,274877906913,566935683040,1168231104479
%N A188716 a(n) = n + (n-1)*(2^n-2).
%C A188716 Number of elements in the semigroup IDT_n.
%H A188716 Vincenzo Librandi, <a href="/A188716/b188716.txt">Table of n, a(n) for n = 0..200</a>
%H A188716 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (6,-13,12,-4).
%F A188716 From _Colin Barker_, Apr 06 2012: (Start)
%F A188716 a(n) = 6*a(n-1)-13*a(n-2)+12*a(n-3)-4*a(n-4).
%F A188716 G.f.: (1-5*x+11*x^2-8*x^3)/((1-x)^2*(1-2*x)^2). (End)
%F A188716 a(n) = A000337(n) - (n-1). - _Andrew Penland_ , Mar 24 2016
%F A188716 E.g.f.: exp(x)*(2 - x + exp(x)*(2*x - 1)). - _Stefano Spezia_, Apr 10 2022
%t A188716 Table[n+(n-1)(2^n-2),{n,0,40}] (* or *) LinearRecurrence[{6,-13,12,-4},{1,1,4,15},40] (* _Harvey P. Dale_, Aug 03 2024 *)
%o A188716 (Magma) [n + (n-1)*(2^n-2): n in [0..50]]; // _Vincenzo Librandi_, May 01 2011
%o A188716 (PARI) a(n)=(n-1)<<n-n+2 \\ _Charles R Greathouse IV_, Apr 06 2012
%Y A188716 Cf. A000337, A188377, A188947.
%K A188716 nonn,easy
%O A188716 0,3
%A A188716 _Adeniji, Adenike_ and Samuel Makanjuola (somakanjuola(AT)unilorin.edu.ng) Apr 14 2011
%E A188716 Edited by _N. J. A. Sloane_, Apr 23 2011
%E A188716 Offset changed from 1 to 0 by _Vincenzo Librandi_, May 01 2011