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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A187325 Floor(n/2) + floor(n/3) + floor(n/4) + floor(n/5). 1
0, 0, 1, 2, 4, 5, 7, 7, 9, 10, 12, 12, 15, 15, 16, 18, 20, 20, 22, 22, 25, 26, 27, 27, 30, 31, 32, 33, 35, 35, 38, 38, 40, 41, 42, 43, 46, 46, 47, 48, 51, 51, 53, 53, 55, 57, 58, 58, 61, 61, 63, 64, 66, 66, 68, 69, 71, 72, 73, 73, 77, 77, 78, 79, 81, 82, 84, 84, 86, 87 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..10000

FORMULA

a(n) = floor(n/2)+floor(n/3)+floor(n/4)+floor(n/5).

a(n) = -a(n-1) -a(n-2) +a(n-4) +2*a(n-5) +2*a(n-6) +a(n-7) -a(n-9) -a(n-10) -a(n-11).

G.f. x^2*(2*x^4+3*x^3+3*x^2+2*x+1)*(2*x^4+x^3+2*x^2+x+1) / ( (1+x)*(1+x+x^2)*(x^4+x^3+x^2+x+1)*(x^2+1)*(x-1)^2 ). - R. J. Mathar, Mar 08 2011

MATHEMATICA

Table[Floor[n/2]+Floor[n/3]+Floor[n/4]+Floor[n/5], {n, 0, 120}]

Table[Total[Floor[n/Range[2, 5]]], {n, 0, 120}] (* Harvey P. Dale, Nov 22 2015 *)

PROG

(MAGMA) [Floor(n/2)+Floor(n/3)+Floor(n/4)+Floor(n/5): n in [0..130] ]; // Vincenzo Librandi, Jul 18 2011

CROSSREFS

Sequence in context: A210936 A140203 A085888 * A112233 A062249 A081404

Adjacent sequences:  A187322 A187323 A187324 * A187326 A187327 A187328

KEYWORD

nonn

AUTHOR

Clark Kimberling, Mar 08 2011

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 6 05:18 EST 2016. Contains 278773 sequences.