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.
%I A346169 #29 Jul 13 2021 06:22:32
%S A346169 0,2,6,17,46,127,346,942,2561,6961,18923,51440,139829,380095,1033206,
%T A346169 2808546,7634421,20752508,56411165,153341447,416825269,1133048555,
%U A346169 3079945300,8372159341,22757888603,61862355045,168159315586,457104411844,1242538616426
%N A346169 a(n) = floor(cosh(n+1) - cosh(n)).
%e A346169 For n = 3, a(3) = 17 because the difference between cosh(4) and cosh(3) is 17.24057..., and floor(17.24057...) = 17.
%t A346169 a[n_] := Floor[Cosh[n+1] - Cosh[n]]; Array[a, 30,0] (* _Amiram Eldar_, Jul 12 2021 *)
%o A346169 (C++)
%o A346169 #include <iostream>
%o A346169 #include <cmath>
%o A346169 using namespace std; int main(int argc, char** argv){for (int n=0; n<=10; n++) {double val = cosh(n+1)-cosh(n); int a = floor(val); cout << a <<","; }}
%Y A346169 Cf. A000501.
%K A346169 nonn
%O A346169 0,2
%A A346169 _Treanungkur Mal_, Jul 08 2021
%E A346169 More terms from _Jinyuan Wang_, Jul 08 2021