cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A304647 #9 May 08 2021 08:28:13
%S A304647 5,8,30,360,1801800,2746644314348614680000,
%T A304647 13268350773236509446586539974366689358164301703214270074935844483572035447570761114173070859428708074413696096366645684575600000000
%N A304647 Smallest term of A304636 that requires exactly n iterations to reach a fixed point under the x -> A181819(x) map.
%C A304647 The first entry 5 is optional so has offset 0.
%e A304647 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 A304647                      5: {3}
%e A304647                      8: {1,1,1}
%e A304647                     30: {1,2,3}
%e A304647                    360: {1,1,1,2,2,3}
%e A304647                1801800: {1,1,1,2,2,3,3,4,5,6}
%e A304647 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 A304647 Function[m,Times@@Prime/@m]/@NestList[Join@@Table[Table[i,{Reverse[#][[i]]}],{i,Length[#]}]&,{3},6]
%Y A304647 Cf. A001221, A001222, A001462, A012257, A014612, A033992, A071625, A112798, A181819, A182850, A182857, A275870, A304464, A304465, A304634, A304636.
%K A304647 nonn
%O A304647 0,1
%A A304647 _Gus Wiseman_, May 15 2018