cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A097882 a(n) = floor( n^2/prime(n) ).

Original entry on oeis.org

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
Offset: 1

Views

Author

Reinhard Zumkeller, Sep 02 2004

Keywords

Crossrefs

Programs

  • Mathematica
    Table[Floor[n^2/Prime[n]], {n,1,50}] (* G. C. Greubel, May 21 2017 *)
  • PARI
    for(n=1,50, print1(floor(n^2/prime(n)), ", ")) \\ G. C. Greubel, May 21 2017

Formula

a(n) = floor(A000290(n)/A000040(n)).
A000290(n) = a(n)*A000040(n) + A069547(n).