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!)
A097882 a(n) = floor( n^2/prime(n) ). 1

%I #10 May 21 2017 14:58:03

%S 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,

%T 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,

%U 13,13,12,13,13,13,13,13,13,14,14,14,14,14,14,15,15,15,15,15,15,15,15,16

%N a(n) = floor( n^2/prime(n) ).

%H G. C. Greubel, <a href="/A097882/b097882.txt">Table of n, a(n) for n = 1..1000</a>

%F a(n) = floor(A000290(n)/A000040(n)).

%F A000290(n) = a(n)*A000040(n)) + A069547(n).

%t Table[Floor[n^2/Prime[n]], {n,1,50}] (* _G. C. Greubel_, May 21 2017 *)

%o (PARI) for(n=1,50, print1(floor(n^2/prime(n)), ", ")) \\ _G. C. Greubel_, May 21 2017

%Y Cf. A000040, A000290, A001221, A069547.

%K nonn

%O 1,4

%A _Reinhard Zumkeller_, Sep 02 2004

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 16 14:51 EDT 2024. Contains 371749 sequences. (Running on oeis4.)