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.

A110958 a(n) = floor(e^(n+1) - e^n) - Fibonacci(n).

This page as a plain text file.
%I A110958 #20 Apr 26 2024 10:59:06
%S A110958 1,3,11,32,90,250,685,1871,5101,13889,37792,102791,279514,759957,
%T A110958 2066036,5616483,15267855,41503419,112819747,306678713,833643774,
%U A110958 2266086165,6159872889,16744290026,45515730839,123724635066,336318509779,914208627271,2485076915041
%N A110958 a(n) = floor(e^(n+1) - e^n) - Fibonacci(n).
%C A110958 The limit of the sums of the reciprocals = 1.472907750614494204850..
%F A110958 a(n) = A248873(n) - A000045(n).
%t A110958 Table[Floor[Exp[n+1]-Exp[n]]-Fibonacci[n],{n,0,28}] (* _James C. McMahon_, Apr 25 2024 *)
%o A110958 (PARI) e(n) = { sr=0; for(x=0, n, y=floor(exp(x+1)-exp(x))-fibonacci(x); print1(y","); sr+=1./y); print(); print(sr) }
%Y A110958 Cf. A000045, A248873.
%K A110958 nonn,easy
%O A110958 0,2
%A A110958 _Cino Hilliard_, Sep 26 2005