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
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, 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, 27, 12, 53, 38, 22, 5, 49, 33, 15, 62, 44, 26, 8, 57, 38, 19, 70 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,5
LINKS
EXAMPLE
x(n) = frac(e * n),
a(0) = floor(x(0) * 0) = floor(0.00 * 0) = 0,
a(1) = floor(x(1) * 1) = floor(0.72 * 1) = 0,
a(2) = floor(x(2) * 2) = floor(0.44 * 2) = 0,
a(3) = floor(x(3) * 3) = floor(0.15 * 3) = 0,
a(4) = floor(x(4) * 4) = floor(0.87 * 4) = 3.
PROG
(Ruby) p (0..50).map {|n| (((Math::E * n) % 1) * n).floor }
CROSSREFS
Cf. A001113, A342730 (uses primes, where this uses positive integers).
Sequence in context: A031251 A194885 A128317 * A179753 A279318 A084269
KEYWORD
nonn
AUTHOR
Simon Strandgaard, May 15 2021
STATUS
approved

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 March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)