|
|
A225666
|
|
Number of nonrepeating vectors in a counting procedure that starts with the digits of n!.
|
|
1
|
|
|
5, 5, 3, 10, 4, 1, 8, 6, 6, 8, 6, 8, 8, 8, 10, 8, 10, 8, 8, 7, 9, 7, 7, 8, 9, 9, 7, 9, 9, 9, 9, 7, 9, 7, 9, 9, 9, 13, 15, 11, 9, 15, 13, 11, 9, 13, 17, 9, 13, 11, 23, 21, 19, 17, 19, 21, 15, 23, 19, 23, 19, 37, 25, 25, 23, 23, 27, 27, 33, 23, 21, 33, 27, 53
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
The counting procedure and "eventually period 6 theorem" are introduced at A225660.
|
|
LINKS
|
|
|
EXAMPLE
|
To see that a(3) = 10, write 3! = 6 -> 0000001 -> 61 -> 0100001-> 52 -> 001001 -> 42 -> 00101 -> 32 -> 0011 -> 22 -> 001 -> 201 -> 111 -> 03 -> 1001 -> 22. This shows that the 10 nonrepeating vectors are (6), (0,0,0,0,0,0,1), (6,1), ... ,and (0,0,1,1). After (0,0,1,1) the cycle (2,2) -> ... -> (2,2) has length 6, so that the remainder of the sequence of vectors is periodic with period 6.
|
|
MATHEMATICA
|
Clear[a, t]; Flatten[Table[a = {t = IntegerDigits[n!]}; While[Count[a, t] =!= 2, AppendTo[a, t = BinCounts[t, {0, Max[t] + 1, 1}]]]; First[Position[a, Last[a]]] - 1, {n, 0, 180}]] (* Peter J. C. Moses, May 09 2013 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|