The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A097882 a(n) = floor( n^2/prime(n) ). 1
 0, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 13, 13, 12, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 16 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS G. C. Greubel, Table of n, a(n) for n = 1..1000 FORMULA a(n) = floor(A000290(n)/A000040(n)). A000290(n) = a(n)*A000040(n)) + A069547(n). MATHEMATICA Table[Floor[n^2/Prime[n]], {n, 1, 50}] (* G. C. Greubel, May 21 2017 *) PROG (PARI) for(n=1, 50, print1(floor(n^2/prime(n)), ", ")) \\ G. C. Greubel, May 21 2017 CROSSREFS Cf. A000040, A000290, A001221, A069547. Sequence in context: A227568 A232746 A052146 * A108955 A108956 A289133 Adjacent sequences: A097879 A097880 A097881 * A097883 A097884 A097885 KEYWORD nonn AUTHOR Reinhard Zumkeller, Sep 02 2004 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.

Last modified October 4 22:25 EDT 2023. Contains 365888 sequences. (Running on oeis4.)