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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A110532 a(n) = floor(n/2) + floor(n/5). 6
 0, 0, 1, 1, 2, 3, 4, 4, 5, 5, 7, 7, 8, 8, 9, 10, 11, 11, 12, 12, 14, 14, 15, 15, 16, 17, 18, 18, 19, 19, 21, 21, 22, 22, 23, 24, 25, 25, 26, 26, 28, 28, 29, 29, 30, 31, 32, 32, 33, 33, 35, 35, 36, 36, 37, 38, 39, 39, 40, 40, 42, 42, 43, 43, 44, 45, 46, 46, 47, 47, 49, 49, 50, 50 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS G. C. Greubel, Table of n, a(n) for n = 0..5000 Index entries for linear recurrences with constant coefficients, signature (0,1,0,0,1,0,-1). FORMULA a(n) = A004526(n) + A002266(n). G.f.: x^2*(1+x+x^2+2*x^3+2*x^4) / ( (1+x)*(x^4+x^3+x^2+x+1)*(x-1)^2 ). - R. J. Mathar, Feb 20 2011 a(n) = 7n/10 + O(1). - Charles R Greathouse IV, Jun 11 2015 MATHEMATICA Table[Floor[n/2]+Floor[n/5], {n, 0, 80}] (* or *) LinearRecurrence[ {0, 1, 0, 0, 1, 0, -1}, {0, 0, 1, 1, 2, 3, 4}, 80] (* Harvey P. Dale, Dec 26 2015 *) PROG (PARI) a(n)=n\2 + n\5 \\ Charles R Greathouse IV, Jun 11 2015 CROSSREFS Cf. A010761, A110533. Sequence in context: A337020 A046700 A216411 * A049987 A270832 A257646 Adjacent sequences:  A110529 A110530 A110531 * A110533 A110534 A110535 KEYWORD nonn,easy AUTHOR Reinhard Zumkeller, Jul 25 2005 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.

Last modified January 26 01:18 EST 2021. Contains 340427 sequences. (Running on oeis4.)