login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065521 a(n) = floor(prime(n) / n) * n - prime(n) mod n. 1
2, 1, 1, 1, 9, 11, 11, 13, 13, 11, 13, 35, 37, 41, 43, 43, 43, 47, 47, 49, 53, 53, 55, 55, 53, 55, 59, 61, 65, 67, 121, 125, 127, 133, 131, 137, 139, 141, 145, 147, 149, 155, 153, 159, 163, 169, 165, 161, 165, 171, 175, 177, 183, 181, 183, 185, 187, 193, 195, 199 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Harry J. Smith, Table of n, a(n) for n = 1..1000

FORMULA

a(n) = A038605(n) * n - A004648(n).

MATHEMATICA

Table[Floor[Prime[n]/n]n-Mod[Prime[n], n], {n, 60}] (* Harvey P. Dale, Dec 27 2019 *)

PROG

(PARI) { for (n=1, 1000, a=floor(prime(n) / n) * n - prime(n) % n; write("b065521.txt", n, " ", a) ) } \\ Harry J. Smith, Oct 20 2009

(PARI) a(n) = n*(prime(n)\n) - (prime(n) % n); \\ Michel Marcus, Jun 18 2018

CROSSREFS

Cf. A038605, A004648.

Sequence in context: A123602 A208896 A288972 * A225700 A156188 A179930

Adjacent sequences:  A065518 A065519 A065520 * A065522 A065523 A065524

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Nov 27 2001

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 21 13:55 EST 2020. Contains 331113 sequences. (Running on oeis4.)