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.

A085421 a(0)=2, a(1)=1, a(n+2)=floor[(e-1/e)*a(n+1)+a(n-2)].

Original entry on oeis.org

2, 1, 4, 10, 27, 73, 198, 538, 1462, 3974, 10802, 29363, 79816, 216962, 589764, 1603144, 4357797, 11845720, 32200005, 87528688, 237927642, 646754385, 1758060692, 4778904432, 12990409077, 35311592938, 95986861417
Offset: 0

Views

Author

Gary W. Adamson, Jun 29 2003

Keywords

Comments

a(n+1)/a(n) converges to e.
For n>0, floor[log a(n)] = n-1.
This resembles a Lucas sequence.

Crossrefs

Extensions

Edited by Don Reble, Nov 14 2005