A309110 Number of possible permutations of a Pyraminx of size n, including the trivial rotation of the tips.
1, 81, 75582720, 217225462874112000, 19228688422470957567836160000000, 52425105093745505455227317179687895040000000000000, 20582183665033346731252760185588627707250626464317440000000000000000000
Offset: 1
Keywords
Links
- Amiram Eldar, Table of n, a(n) for n = 1..23
- Michael Gottlieb, Notes on Twisty Puzzles
- Chen Shuang, Number of states for twisty puzzles, github.
- Wikipedia, Pyraminx
Crossrefs
Programs
-
PARI
a(n) = if(n==1, 1, 81 * if(n==2, 1, 5 * (if(!(n%3), 2^(2*n^2-3*n-1) * 3^(n^2/3+3*n-6) * 1925^(n^2/3-n), 2^(2*n^2-3*n-1) * 3^(n^2/3+3*n-16/3) * 1925^(n^2/3-n-1/3)))))
Formula
a(n) = 272097792 * 369600^(2*n-6) * a(n-3) for n >= 6.
a(n) = 81 * A309109(n) for n >= 2.
Comments