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)].

This page as a plain text file.
%I A085421 #4 Oct 19 2017 03:14:19
%S A085421 2,1,4,10,27,73,198,538,1462,3974,10802,29363,79816,216962,589764,
%T A085421 1603144,4357797,11845720,32200005,87528688,237927642,646754385,
%U A085421 1758060692,4778904432,12990409077,35311592938,95986861417
%N A085421 a(0)=2, a(1)=1, a(n+2)=floor[(e-1/e)*a(n+1)+a(n-2)].
%C A085421 a(n+1)/a(n) converges to e.
%C A085421 For n>0, floor[log a(n)] = n-1.
%C A085421 This resembles a Lucas sequence.
%Y A085421 Cf. A000149, A085422, A085839.
%K A085421 nonn
%O A085421 0,1
%A A085421 _Gary W. Adamson_, Jun 29 2003
%E A085421 Edited by _Don Reble_, Nov 14 2005