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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A011873 a(n) = floor(n(n-1)/20). 1
0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 4, 5, 6, 7, 9, 10, 12, 13, 15, 17, 19, 21, 23, 25, 27, 30, 32, 35, 37, 40, 43, 46, 49, 52, 56, 59, 63, 66, 70, 74, 78, 82, 86, 90, 94, 99, 103, 108, 112, 117, 122, 127, 132, 137, 143, 148, 154, 159, 165, 171, 177, 183, 189 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,8
LINKS
Index entries for linear recurrences with constant coefficients, signature (2,-1,0,0,1,-2,1,0,0,-1,2,-1,0,0,1,-2,1).
FORMULA
From R. J. Mathar, Apr 15 2010: (Start)
a(n) = +2*a(n-1) -a(n-2) +a(n-5) -2*a(n-6) +a(n-7) -a(n-10) +2*a(n-11) -a(n-12) +a(n-15) -2*a(n-16) +a(n-17).
G.f.: x^5*(x^2-x+1)*(x^6-x^3+1) / ((1-x)^3*(x^2+1)*(x^4+x^3+x^2+x+1)*(x^8-x^6+x^4-x^2+1) ). (End)
MATHEMATICA
Table[Floor[n(n-1)/20], {n, 0, 550}] (* G. C. Greubel, Sep 03 2015 *)
LinearRecurrence[{2, -1, 0, 0, 1, -2, 1, 0, 0, -1, 2, -1, 0, 0, 1, -2, 1}, {0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 4, 5, 6, 7, 9, 10, 12}, 80] (* Vincenzo Librandi, Sep 03 2015 *)
PROG
(PARI) a(n) = n*(n-1)\20; \\ Michel Marcus, Sep 03 2015
(Magma) [n*(n-1) div 20: n in [0..80]] /* or */ I:=[0, 0, 0, 0, 0, 1, 1, 2, 2, 3, 4, 5, 6, 7, 9, 10, 12]; [n le 17 select I[n] else +2*Self(n-1) -Self(n-2) +Self(n-5) -2*Self(n-6) +Self(n-7) -Self(n-10) +2*Self(n-11) -Self(n-12) +Self(n-15) -2*Self(n-16) +Self(n-17): n in [1..70]]; // Vincenzo Librandi, Sep 03 2015
CROSSREFS
Sequence in context: A339094 A286874 A065459 * A173151 A008673 A133564
KEYWORD
nonn,easy
AUTHOR
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 19 06:53 EDT 2024. Contains 370953 sequences. (Running on oeis4.)