login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

Smallest term of A304636 that requires exactly n iterations to reach a fixed point under the x -> A181819(x) map.
3

%I #9 May 08 2021 08:28:13

%S 5,8,30,360,1801800,2746644314348614680000,

%T 13268350773236509446586539974366689358164301703214270074935844483572035447570761114173070859428708074413696096366645684575600000000

%N Smallest term of A304636 that requires exactly n iterations to reach a fixed point under the x -> A181819(x) map.

%C The first entry 5 is optional so has offset 0.

%e The list of multisets with Heinz numbers in the sequence is the following. The number of k's in row n + 1 is equal to the k-th largest term of row n.

%e 5: {3}

%e 8: {1,1,1}

%e 30: {1,2,3}

%e 360: {1,1,1,2,2,3}

%e 1801800: {1,1,1,2,2,3,3,4,5,6}

%e 2746644314348614680000: {1,1,1,1,1,1,2,2,2,2,2,3,3,3,3,4,4,4,5,5,5,6,6,7,7,8,9,10}

%t Function[m,Times@@Prime/@m]/@NestList[Join@@Table[Table[i,{Reverse[#][[i]]}],{i,Length[#]}]&,{3},6]

%Y Cf. A001221, A001222, A001462, A012257, A014612, A033992, A071625, A112798, A181819, A182850, A182857, A275870, A304464, A304465, A304634, A304636.

%K nonn

%O 0,1

%A _Gus Wiseman_, May 15 2018