A333333 - OEIS

A333333

Irregular triangle: T(n,k) gives the number of k-polysticks on edges of the n-cube up to isometries of the n-cube, with 0 <= k <= A001787(n).

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 4, 9, 14, 19, 16, 9, 4, 1, 1, 1, 1, 1, 3, 7, 21, 72, 269, 994, 3615, 12337, 38603, 107720, 259990, 526314, 865217, 1139344, 1225762, 1109138, 857376, 574284, 333484, 169023, 73994, 28222, 9138, 2595, 604, 140, 24, 6, 1, 1

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,11

COMMENTS

This sequence counts edge-induced connected subgraphs of the n-dimensional hypercube graph, up to automorphisms of the hypercube; A369605 counts vertex-induced such graphs. - Pontus von Brömssen, May 12 2025

Row 3 gives the number of polyforms with n cells on the faces of a rhombic dodecahedron up to rotation and reflection. - Peter Kagey, May 19 2025

LINKS

Table of n, a(n) for n=1..53.

Code Golf Stack Exchange, Counting polyominoes on (hyper-)cubes

Peter Kagey, Examples of T(3,3) through T(3,8).

Wikipedia, Hypercube

Wikipedia, Polystick

FORMULA

T(n,k) = T(n-1,k) for k < n.

T(n,0) = T(n,1) = T(n,2) = T(n,A001787(n)-1) = T(n,A001787(n)) = 1.

A222192(n) = Sum_{k=0..n*2^(n-1)} T(n,k) - Sum_{k=0..(n-1)*2^(n-2)} T(n-1,k) for n >= 2. - Peter Kagey, Jun 19 2023

EXAMPLE