cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A005732 a(n) = binomial(n+3,6) + binomial(n+1,5) + binomial(n,5).

Original entry on oeis.org

1, 8, 35, 111, 287, 644, 1302, 2430, 4257, 7084, 11297, 17381, 25935, 37688, 53516, 74460, 101745, 136800, 181279, 237083, 306383, 391644, 495650, 621530, 772785, 953316, 1167453, 1419985, 1716191, 2061872, 2463384, 2927672, 3462305, 4075512, 4776219, 5574087, 6479551
Offset: 3

Views

Author

Keywords

Comments

Place n points in general position on a circle, join them in all possible ways; how many triangles can be seen?
Equals binomial transform of [1, 7, 20, 29, 22, 8, 1, 0, 0, 0, ...]. - Gary W. Adamson, Jun 13 2008

References

  • C. L. Liu, Introduction to Combinatorial Analysis. McGraw-Hill, NY, 1968, p. 20.
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Often confused with A006600.

Programs

  • Haskell
    a005732 n = a005732_list !! (n-3)
    a005732_list = 1 : 8 : f (drop 5 a007318_tabl) where
       f (us:pss@(vs::ws:)) = (us !! 5 + vs !! 5 + ws !! 6) : f pss
    -- Reinhard Zumkeller, Mar 11 2014
    
  • Magma
    [Binomial(n+3, 6) + Binomial(n+1, 5) +Binomial(n,5): n in [3..100]]; // Vincenzo Librandi, Apr 10 2011
    
  • Mathematica
    Table[Binomial[n+3,6]+Binomial[n+1,5]+Binomial[n,5],{n,3,40}]  (* Harvey P. Dale, Apr 09 2011 *)
  • PARI
    a(n)=binomial(n+3,6) + binomial(n+1,5) + binomial(n,5) \\ Charles R Greathouse IV, Feb 19 2017

Formula

G.f.: x^3*(-1-x+x^3) / (x-1)^7 . - Simon Plouffe in his 1992 dissertation
a(2n-1) = A006600(2n-1) for n > 1; a(2n) = A006600(2n) + A260417(n) for n > 1. - Jonathan Sondow, Jul 25 2015

Extensions

Thanks to Joshua Zucker, Ted Alper and Joe Keane for clarifying the connection with A006600.