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!)
A128104 a(n) = largest multiple of n which is < exp(n). 2

%I #21 Nov 11 2014 18:18:38

%S 2,6,18,52,145,402,1092,2976,8100,22020,59873,162744,442403,1202600,

%T 3269010,8886096,24154943,65659968,178482295,485165180,1318815729,

%U 3584912826,9744803438,26489122128,72004899325,195729609426

%N a(n) = largest multiple of n which is < exp(n).

%F a(n) = n * floor(e^n/n) = n* A107316(n).

%p seq(n*floor(exp(n)/n), n=1..30); # _Robert Israel_, Nov 09 2014

%t f[n_] := n*Floor[Exp[n]/n];Array[f, 28] (* _Ray Chandler_, Feb 19 2007 *)

%t f[n_] := -First@ Mod[ Exp[n], n]; Array[f, 27] (* _Robert G. Wilson v_, Feb 19 2007 *)

%Y Cf. A128105, A107316.

%K nonn

%O 1,1

%A _Leroy Quet_, Feb 14 2007

%E Extended by _Robert G. Wilson v_ and _Ray Chandler_, Feb 19 2007

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 April 25 13:42 EDT 2024. Contains 371971 sequences. (Running on oeis4.)