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.

Original entry on oeis.org

5, 8, 30, 360, 1801800, 2746644314348614680000, 13268350773236509446586539974366689358164301703214270074935844483572035447570761114173070859428708074413696096366645684575600000000
Offset: 0

Views

Author

Gus Wiseman, May 15 2018

Keywords

Comments

The first entry 5 is optional so has offset 0.

Examples

			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.
                     5: {3}
                     8: {1,1,1}
                    30: {1,2,3}
                   360: {1,1,1,2,2,3}
               1801800: {1,1,1,2,2,3,3,4,5,6}
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}
		

Crossrefs

Programs

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