login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A225609 Recurrence a(n) = 2^n*a(n-1) + a(n-2) with a(0)=0, a(1)=1. 2

%I

%S 0,1,4,33,532,17057,1092180,139816097,35794013012,18326674478241,

%T 18766550459731796,38433913668205196449,157425329151518944386900,

%U 1289628334843156860622681249,21129270795495611155960953970516,692363946716428521201685400328549537

%N Recurrence a(n) = 2^n*a(n-1) + a(n-2) with a(0)=0, a(1)=1.

%H Seiichi Manyama, <a href="/A225609/b225609.txt">Table of n, a(n) for n = 0..81</a>

%F a(n) ~ c * 2^(n^2/2 + n/2), where c = 0.52087674149344124670486211129137...

%t RecurrenceTable[{a[n]==2^n*a[n-1]+a[n-2],a[0]==0,a[1]==1},a,{n,0,15}]

%Y Cf. A006116, A073587, A073588, A076131, A228465, A228467.

%K nonn

%O 0,3

%A _Vaclav Kotesovec_, Aug 22 2013

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 14 19:48 EDT 2020. Contains 335729 sequences. (Running on oeis4.)