The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A106006 [n/2] + [n/3] + [n/5]. 0
 0, 0, 1, 2, 3, 4, 6, 6, 7, 8, 10, 10, 12, 12, 13, 15, 16, 16, 18, 18, 20, 21, 22, 22, 24, 25, 26, 27, 28, 28, 31, 31, 32, 33, 34, 35, 37, 37, 38, 39, 41, 41, 43, 43, 44, 46, 47, 47, 49, 49, 51, 52, 53, 53, 55, 56, 57, 58, 59, 59, 62, 62, 63, 64, 65, 66, 68, 68, 69, 70, 72, 72, 74, 74, 75 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 LINKS Index entries for linear recurrences with constant coefficients, signature (-1,0,1,1,1,1,0,-1,-1). FORMULA G.f.: x^2*(1-x)(3x^6+6x^5+7x^4+6x^3+5x^2+3x+1)/[(1-x^2)(1-x^3)(1-x^5) ]. a(n) = kn + O(1), where k = 31/30. - Charles R Greathouse IV, Dec 04 2013 PROG (PARI) a(n)=n\2+n\3+n\5 \\ Charles R Greathouse IV, Dec 04 2013 CROSSREFS Sequence in context: A297351 A060019 A093451 * A050460 A246594 A175808 Adjacent sequences: A106003 A106004 A106005 * A106007 A106008 A106009 KEYWORD nonn,easy AUTHOR Jonathan Vos Post, Jan 19 2007 STATUS approved

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.

Last modified December 1 15:59 EST 2022. Contains 358468 sequences. (Running on oeis4.)