This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A002089 a(n) = 11*4^n. 8

%I

%S 11,44,176,704,2816,11264,45056,180224,720896,2883584,11534336,

%T 46137344,184549376,738197504,2952790016,11811160064,47244640256,

%U 188978561024,755914244096,3023656976384,12094627905536,48378511622144,193514046488576,774056185954304

%N a(n) = 11*4^n.

%C Subsequence of A000069, the odious numbers. - _Reinhard Zumkeller_, Aug 26 2007

%H Vincenzo Librandi, <a href="/A002089/b002089.txt">Table of n, a(n) for n = 0..500</a>

%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>

%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (4).

%F From _Philippe DelĂ©ham_, Nov 23 2008: (Start)

%F a(n) = 4*a(n-1); a(0)=11.

%F G.f.: 11/(1-4*x). (End)

%F a(n) = 11*A000302(n). - _Michel Marcus_, Nov 13 2013

%p A002089:=n->11*4^n; seq(A002089(n), n=0..100); # _Wesley Ivan Hurt_, Nov 12 2013

%t 11*4^Range[0, 100] (* _Vladimir Joseph Stephan Orlovsky_, Jun 09 2011 *)

%t NestList[4#&,11,30] (* _Harvey P. Dale_, Jun 19 2014 *)

%o (MAGMA) [11*4^n: n in [0..30]]; // _Vincenzo Librandi_, May 31 2011

%o (PARI) a(n)=11*4^n \\ _Charles R Greathouse IV_, Apr 18 2012

%Y Bisection of A005015. Half the first differences of A072261.

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 23 23:51 EDT 2019. Contains 328379 sequences. (Running on oeis4.)