cp's OEIS Frontend

A002089 a(n) = 11*4^n.

%I A002089 #48 Apr 02 2025 14:29:32
%S A002089 11,44,176,704,2816,11264,45056,180224,720896,2883584,11534336,
%T A002089 46137344,184549376,738197504,2952790016,11811160064,47244640256,
%U A002089 188978561024,755914244096,3023656976384,12094627905536,48378511622144,193514046488576,774056185954304,3096224743817216
%N A002089 a(n) = 11*4^n.
%C A002089 Subsequence of A000069, the odious numbers. - _Reinhard Zumkeller_, Aug 26 2007
%H A002089 Vincenzo Librandi, <a href="/A002089/b002089.txt">Table of n, a(n) for n = 0..500</a>
%H A002089 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>.
%H A002089 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (4).
%F A002089 From _Philippe Deléham_, Nov 23 2008: (Start)
%F A002089 a(n) = 4*a(n-1); a(0)=11.
%F A002089 G.f.: 11/(1-4*x). (End)
%F A002089 a(n) = 11*A000302(n). - _Michel Marcus_, Nov 13 2013
%F A002089 From _Elmo R. Oliveira_, Apr 02 2025: (Start)
%F A002089 E.g.f.: 11*exp(4*x).
%F A002089 a(n) = A005015(2*n). (End)
%p A002089 A002089:=n->11*4^n; seq(A002089(n), n=0..100); # _Wesley Ivan Hurt_, Nov 12 2013
%t A002089 11*4^Range[0, 100] (* _Vladimir Joseph Stephan Orlovsky_, Jun 09 2011 *)
%t A002089 NestList[4#&,11,30] (* _Harvey P. Dale_, Jun 19 2014 *)
%o A002089 (Magma) [11*4^n: n in [0..30]]; // _Vincenzo Librandi_, May 31 2011
%o A002089 (PARI) a(n)=11*4^n \\ _Charles R Greathouse IV_, Apr 18 2012
%Y A002089 Bisection of A005015. Half the first differences of A072261.
%K A002089 nonn,easy
%O A002089 0,1
%A A002089 _N. J. A. Sloane_