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!)
A300846 a(n) = 3*(n - 1)^2*n^3. 0
0, 0, 24, 324, 1728, 6000, 16200, 37044, 75264, 139968, 243000, 399300, 627264, 949104, 1391208, 1984500, 2764800, 3773184, 5056344, 6666948, 8664000, 11113200, 14087304, 17666484, 21938688, 27000000, 32955000, 39917124, 48009024, 57362928, 68121000 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Also the number of 5-cycles in the complete tripartite graph K_{n,n,n} for n >= 1.
LINKS
Eric Weisstein's World of Mathematics, Graph Cycle
Eric Weisstein's World of Mathematics, Complete Tripartite Graph
FORMULA
G.f.: 12*x^2*(2 + 15*x + 12*x^2 + x^3)/(x - 1)^6.
a(n) = 6*a(n-1) - 15*a(n-2) + 20*a(n-3) - 15*a(n-4) + 6*a(n-5) - a(n-6).
a(n) = 3*A099762(n-1).
a(n) = 3*(n - 1)^5 + 9*(n - 1)^4 + 9*(n - 1)^3 + 3*(n - 1)^2.
MATHEMATICA
Table[3 (n - 1)^2 n^3, {n, 0, 20}]
LinearRecurrence[{6, -15, 20, -15, 6, -1}, {0, 0, 24, 324, 1728, 6000}, 20]
CoefficientList[Series[12 x^2 (2 + 15 x + 12 x^2 + x^3)/(x - 1)^6, {x, 0, 20}], x]
PROG
(PARI) a(n) = 3*(n-1)^2*n^3; \\ Altug Alkan, Mar 13 2018
CROSSREFS
Sequence in context: A199301 A239793 A289706 * A006922 A036221 A022652
KEYWORD
nonn,easy
AUTHOR
Eric W. Weisstein, Mar 13 2018
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 April 25 10:51 EDT 2024. Contains 371967 sequences. (Running on oeis4.)