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!)
 A011941 a(n) = floor(n*(n-1)*(n-2)*(n-3)/31). 1
 0, 0, 0, 0, 0, 3, 11, 27, 54, 97, 162, 255, 383, 553, 774, 1056, 1409, 1842, 2369, 3000, 3750, 4633, 5663, 6855, 8226, 9793, 11574, 13587, 15851, 18387, 21216, 24360, 27840, 31680, 35904, 40536, 45603, 51131, 57147, 63678, 70753, 78402, 86655, 95543 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,6 LINKS Robert Israel, Table of n, a(n) for n = 0..10000 FORMULA G.f.: (3-x+x^2+2*x^4+x^5+x^7+2*x^9+x^10-x^12+5*x^13-4*x^14+5*x^15-x^16+x^18+2*x^19+x^21+x^23+2*x^24+x^26-x^27+3*x^28)*x^5/((1-x)^4*(1-x^31)). - Robert Israel, Feb 12 2017 MAPLE f:= n -> floor(n*(n-1)*(n-2)*(n-3)/31): map(f, [\$0..100]); # Robert Israel, Feb 12 2017 PROG (PARI) a(n) = n*(n-1)*(n-2)*(n-3)\31; \\ Altug Alkan, Feb 12 2017 CROSSREFS Sequence in context: A212982 A164845 A024194 * A219621 A033960 A147173 Adjacent sequences:  A011938 A011939 A011940 * A011942 A011943 A011944 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 11 21:35 EDT 2021. Contains 343808 sequences. (Running on oeis4.)