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!)
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). 3
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,11
LINKS
Code Golf Stack Exchange, Counting polyominoes on (hyper-)cubes
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
Table begins:
n\k| 0 1 2 3 4 5 6 7 8 9 10 11 12 ...
---+---------------------------------------------------
1| 1, 1;
2| 1, 1, 1, 1, 1;
3| 1, 1, 1, 3, 4, 9, 14, 19, 16, 9, 4, 1, 1;
4| 1, 1, 1, 3, 7, 21, 72, 269, 994, 3615, ...
CROSSREFS
Sequence in context: A342570 A050163 A207016 * A095292 A263821 A007293
KEYWORD
nonn,more,tabf
AUTHOR
Peter Kagey, Mar 15 2020
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 18 03:01 EDT 2024. Contains 371767 sequences. (Running on oeis4.)