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.

A275109 Number of times each term of the sequence A025586 (largest value in Collatz trajectory of n) occurs.

Original entry on oeis.org

1, 1, 1, 1, 6, 1, 1, 1, 3, 1, 12, 1, 3, 1, 1, 1, 1, 8, 1, 3, 1, 3, 1, 1, 1, 3, 1, 3, 1, 13, 1, 1, 1, 3, 1, 8, 1, 3, 1, 1, 1, 6, 1, 3, 3, 1, 1, 1, 1, 3, 1, 1, 14, 1, 1, 1, 1, 1, 6, 1, 3, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 3, 6, 1, 1, 1, 1, 3, 1, 1, 1, 8, 1, 3, 1, 3
Offset: 1

Views

Author

Jaroslav Krizek, Jul 16 2016

Keywords

Comments

The possible values of the sequence A025586 are in A033496. Value A033496(n) occurs exactly a(n) times.

Examples

			a(5) = 6 because there is 6 numbers m such that A025586(m) = A033496(5) = 16: 3, 5, 6, 10, 12 and 16.
See A095387; there is 1579 numbers m such that A025586(m) = 9232 = A033496(940); a(940) = 1579.
		

Crossrefs