login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A144769 a(n) = floor(prime(n)/3). 4
0, 1, 1, 2, 3, 4, 5, 6, 7, 9, 10, 12, 13, 14, 15, 17, 19, 20, 22, 23, 24, 26, 27, 29, 32, 33, 34, 35, 36, 37, 42, 43, 45, 46, 49, 50, 52, 54, 55, 57, 59, 60, 63, 64, 65, 66, 70, 74, 75, 76, 77, 79, 80, 83, 85, 87, 89, 90, 92, 93, 94, 97, 102, 103, 104, 105, 110, 112, 115, 116 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

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

FORMULA

a(n) = floor(A000040(n)/3). - R. J. Mathar, Sep 21 2008

MAPLE

A144769 := proc(n) floor(ithprime(n)/3); end; # R. J. Mathar, Sep 21 2008

MATHEMATICA

Quotient[Prime[Range[5! ]], 3]

PROG

(PARI) a(n)=prime(n)\3 \\ Charles R Greathouse IV, Oct 05 2011

CROSSREFS

See A130290 for prime(n)/2 or A075518 for prime(n)/4.

Sequence in context: A125299 A063949 A073518 * A165737 A033104 A191325

Adjacent sequences:  A144766 A144767 A144768 * A144770 A144771 A144772

KEYWORD

nonn,easy

AUTHOR

Vladimir Joseph Stephan Orlovsky, Sep 20 2008

EXTENSIONS

Edited by R. J. Mathar, Sep 21 2008

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 August 25 03:10 EDT 2019. Contains 326318 sequences. (Running on oeis4.)