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.

A382261 a(n) = floor(x^(phi^n)), where phi = (1+sqrt(5))/2 and x is the constant A382260.

Original entry on oeis.org

2, 3, 7, 23, 163, 3803, 620549, 2359981439, 1464484123012601, 3456155348019933976288373, 5061484633840283809323162088349619180781, 17493277186167814180104995425523045477935447066389138909089293633
Offset: 1

Views

Author

Thomas Scheuerle, Mar 19 2025

Keywords

Comments

Conjecture: All terms are prime numbers. For details see A382260.

Crossrefs

Cf. A090253 ( similar growth ).

Formula

nextprime(a(n-2)*a(n-1)) <= a(n) < nextprime((a(n-2)+1)*a(n-1)).