The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A346169 a(n) = floor(cosh(n+1) - cosh(n)). 0

%I #29 Jul 13 2021 06:22:32

%S 0,2,6,17,46,127,346,942,2561,6961,18923,51440,139829,380095,1033206,

%T 2808546,7634421,20752508,56411165,153341447,416825269,1133048555,

%U 3079945300,8372159341,22757888603,61862355045,168159315586,457104411844,1242538616426

%N a(n) = floor(cosh(n+1) - cosh(n)).

%e For n = 3, a(3) = 17 because the difference between cosh(4) and cosh(3) is 17.24057..., and floor(17.24057...) = 17.

%t a[n_] := Floor[Cosh[n+1] - Cosh[n]]; Array[a, 30,0] (* _Amiram Eldar_, Jul 12 2021 *)

%o (C++)

%o #include <iostream>

%o #include <cmath>

%o 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 Cf. A000501.

%K nonn

%O 0,2

%A _Treanungkur Mal_, Jul 08 2021

%E More terms from _Jinyuan Wang_, Jul 08 2021

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 5 14:10 EDT 2024. Contains 373105 sequences. (Running on oeis4.)