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!)
A079415 a(n) = floor(prime(n)/n) * ceiling(prime(n)/n) / 2. 1
2, 1, 1, 1, 3, 3, 3, 3, 3, 3, 3, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 15, 10, 10, 10, 15, 15, 15, 15, 15, 15, 15 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
MATHEMATICA
fc[n_]:=Module[{c=Prime[n]/n}, (Floor[c]Ceiling[c])/2]; Array[fc, 80] (* Harvey P. Dale, May 20 2015 *)
PROG
(PARI) vector(80, n, floor(prime(n)/n)*ceil(prime(n)/n)/2) \\ G. C. Greubel, Jan 19 2019
(Magma) [Floor(NthPrime(n)/n)*Ceiling(NthPrime(n)/n)/2: n in [1..80]]; // G. C. Greubel, Jan 19 2019
(Sage) [floor(nth_prime(n)/n)*ceil(nth_prime(n)/n)/2 for n in (1..80)] # G. C. Greubel, Jan 19 2019
CROSSREFS
Sequence in context: A227543 A366920 A344678 * A126347 A309240 A057001
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Jan 07 2003
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 April 25 10:43 EDT 2024. Contains 371967 sequences. (Running on oeis4.)