login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A353029
Number of copies of the star graph S(2,2,2) contained in the n-dimensional hypercube graph.
1
0, 0, 16, 1152, 16640, 140800, 887040, 4616192, 20987904, 86261760, 327782400, 1169653760, 3964207104, 12869828608, 40285306880, 122211532800, 360794030080, 1040028008448, 2935426646016, 8130951905280, 22146344550400, 59411980615680, 157208570494976
OFFSET
1,3
COMMENTS
S(2,2,2) is the star graph with three legs of length two.
FORMULA
a(n) = 2^n*C(n,3)*((n-1)^3 - 3*(n-1)).
G.f.: 16*x^3*(1 + 58*x + 116*x^2 + 8*x^3)/(1 - 2*x)^7. - Stefano Spezia, Apr 20 2022
PROG
(Python) from math import comb
def a(n):
return (2**n)*comb(n, 3)*((n-1)**3-3*(n-1))
CROSSREFS
Sequence in context: A209541 A374493 A279295 * A053903 A254333 A102807
KEYWORD
nonn,easy
AUTHOR
Ben Eck, Apr 20 2022
STATUS
approved