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!)
A344348 a(n) = floor(frac(e * n) * n). 0

%I #11 May 23 2021 03:09:07

%S 0,0,0,0,3,2,1,0,5,4,1,9,7,4,0,11,7,3,16,12,7,1,17,11,5,23,17,10,3,24,

%T 16,8,31,23,14,4,30,21,11,0,29,18,7,38,26,14,1,35,22,9,45,32,18,3,42,

%U 27,12,53,38,22,5,49,33,15,62,44,26,8,57,38,19,70

%N a(n) = floor(frac(e * n) * n).

%e x(n) = frac(e * n),

%e a(0) = floor(x(0) * 0) = floor(0.00 * 0) = 0,

%e a(1) = floor(x(1) * 1) = floor(0.72 * 1) = 0,

%e a(2) = floor(x(2) * 2) = floor(0.44 * 2) = 0,

%e a(3) = floor(x(3) * 3) = floor(0.15 * 3) = 0,

%e a(4) = floor(x(4) * 4) = floor(0.87 * 4) = 3.

%o (Ruby) p (0..50).map {|n| (((Math::E * n) % 1) * n).floor }

%Y Cf. A001113, A342730 (uses primes, where this uses positive integers).

%K nonn

%O 0,5

%A _Simon Strandgaard_, May 15 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 September 13 11:59 EDT 2024. Contains 375907 sequences. (Running on oeis4.)