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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A116579 a(1) = a(2) = 1; a(n) = floor(prime(n)/6) for n > 2. 1
1, 1, 0, 1, 1, 2, 2, 3, 3, 4, 5, 6, 6, 7, 7, 8, 9, 10, 11, 11, 12, 13, 13, 14, 16, 16, 17, 17, 18, 18, 21, 21, 22, 23, 24, 25, 26, 27, 27, 28, 29, 30, 31, 32, 32, 33, 35, 37, 37, 38, 38, 39, 40, 41, 42, 43, 44, 45, 46, 46, 47, 48, 51, 51, 52, 52, 55, 56, 57, 58, 58, 59, 61, 62, 63, 63, 64, 66, 66 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

LINKS

Table of n, a(n) for n=1..79.

FORMULA

a(1) = a(2) = 1; a(n) = floor(prime(n)/6) for n > 2.

MATHEMATICA

a[1] = a[2] = 1; a[n_] := Floor[Prime[n]/6]; Array[a, 100] (* Giovanni Resta, Nov 19 2019 *)

PROG

(PARI) apply( A116579(n)=if(n>2, prime(n)\6, 1), [1..99]) \\ M. F. Hasler, Nov 20 2019

CROSSREFS

Sequence in context: A255573 A062298 A283371 * A156253 A346693 A265436

Adjacent sequences:  A116576 A116577 A116578 * A116580 A116581 A116582

KEYWORD

nonn,less

AUTHOR

Roger L. Bagula, Mar 21 2006

EXTENSIONS

Name edited by Giovanni Resta, Nov 19 2019

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 October 28 18:13 EDT 2021. Contains 348329 sequences. (Running on oeis4.)