The OEIS is supported by the many generous donors to the OEIS Foundation.

 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
 0, 1, 4, 33, 532, 17057, 1092180, 139816097, 35794013012, 18326674478241, 18766550459731796, 38433913668205196449, 157425329151518944386900, 1289628334843156860622681249, 21129270795495611155960953970516, 692363946716428521201685400328549537 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Seiichi Manyama, Table of n, a(n) for n = 0..81 FORMULA a(n) ~ c * 2^(n^2/2 + n/2), where c = 0.52087674149344124670486211129137... MATHEMATICA RecurrenceTable[{a[n]==2^n*a[n-1]+a[n-2], a[0]==0, a[1]==1}, a, {n, 0, 15}] CROSSREFS Cf. A006116, A073587, A073588, A076131, A228465, A228467. Sequence in context: A219504 A258180 A072754 * A113086 A058153 A020197 Adjacent sequences: A225606 A225607 A225608 * A225610 A225611 A225612 KEYWORD nonn AUTHOR Vaclav Kotesovec, Aug 22 2013 STATUS approved

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

Last modified August 10 02:46 EDT 2024. Contains 375044 sequences. (Running on oeis4.)