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.

Showing 1-2 of 2 results.

A000659 a(n) = 2^a(n-1) + a(n-2).

Original entry on oeis.org

0, 0, 1, 2, 5, 34, 17179869189
Offset: 0

Views

Author

Keywords

Comments

The next term has 5171655948 digits. - Franklin T. Adams-Watters, Jul 03 2009

Crossrefs

Cf. A000643.

Programs

A114641 a(n) = 2^(a(n-2) + log_{2}(a(n-1))), a(1)=1, a(2)=2.

Original entry on oeis.org

1, 2, 4, 16, 256, 16777216, 1942668892225729070919461906823518906642406839052139521251812409738904285205208498176
Offset: 1

Views

Author

Yasutoshi Kohmoto, Feb 18 2006

Keywords

Comments

The subsequent terms are too large to include.
Apparently a(n) = A000643(n+2) - A000643(n+1). - R. J. Mathar, Apr 22 2007

Crossrefs

Programs

  • Mathematica
    RecurrenceTable[{a[1]==1,a[2]==2,a[n]==2^(a[n-2]+Log[2,a[n-1]])},a,{n,6}] (* Harvey P. Dale, Aug 23 2013 *)

Formula

a(n) = a(n-1) * 2^a(n-2) for n >= 3. - Alois P. Heinz, Jun 28 2021

Extensions

Definition adapted to offset by Georg Fischer, Jun 18 2021
Showing 1-2 of 2 results.