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!)
A116572 a(n) = floor(prime(n)/5) for n > 2, a(1) = a(2) = 1. 2

%I #34 Sep 08 2022 08:45:24

%S 1,1,1,1,2,2,3,3,4,5,6,7,8,8,9,10,11,12,13,14,14,15,16,17,19,20,20,21,

%T 21,22,25,26,27,27,29,30,31,32,33,34,35,36,38,38,39,39,42,44,45,45,46,

%U 47,48,50,51,52,53,54,55,56,56,58,61,62,62,63,66,67,69

%N a(n) = floor(prime(n)/5) for n > 2, a(1) = a(2) = 1.

%H G. C. Greubel, <a href="/A116572/b116572.txt">Table of n, a(n) for n = 1..5000</a>

%t Join[{1, 1}, Quotient[Prime[Range[3, 80]], 5]] (* _Vincenzo Librandi_, Apr 14 2015 *)

%o (Magma) [1,1] cat [NthPrime(n) div 5: n in [3..80]]; // _Vincenzo Librandi_, Apr 14 2015

%o (PARI) a(n)=if(n<5, 1, prime(n)\5) \\ _Charles R Greathouse IV_, Sep 21 2017

%K nonn,easy,less

%O 1,5

%A _Roger L. Bagula_, Mar 18 2006

%E More terms from _Vincenzo Librandi_, Apr 14 2015

%E Offset corrected by _Charles R Greathouse IV_, Sep 21 2017

%E New name from _Charles R Greathouse IV_, Sep 21 2017

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 May 7 17:41 EDT 2024. Contains 372312 sequences. (Running on oeis4.)