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.

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

Original entry on oeis.org

0, 1, 4, 33, 532, 17057, 1092180, 139816097, 35794013012, 18326674478241, 18766550459731796, 38433913668205196449, 157425329151518944386900, 1289628334843156860622681249, 21129270795495611155960953970516, 692363946716428521201685400328549537
Offset: 0

Views

Author

Vaclav Kotesovec, Aug 22 2013

Keywords

Crossrefs

Programs

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

Formula

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