A277606 Frequency of n in A245499.

1, 1, 2, 1, 1, 3, 1, 5, 1, 3, 1, 4, 1, 2, 5, 1, 1, 7, 1, 4, 2, 2, 1, 5, 1, 2, 5, 3, 1, 3, 1, 9, 2, 2, 5, 1, 1, 2, 2, 5, 1, 4, 1, 2, 4, 2, 1, 6, 1, 8, 2, 3, 1, 5, 2, 5, 2, 2, 1, 6, 1, 2, 7, 1, 3, 4, 1, 2, 2, 5, 1, 13, 1, 2, 10, 2, 6, 2, 1, 7, 1, 2

Offset: 1

Author

David A. Corneth, Oct 23 2016

Keywords

• nonn

Comments

From David A. Corneth, Jan 02 2018: (Start)

For every positive integer n, we can create a tuple b of t increasing positive integers with b_1 = n, the product of these elements a perfect square and the largest element as small as possible.

A006255 lists b_t, the largest element of these tuples, A245499 lists these tuples and this sequence lists the frequency of n occurring in such a tuple, i.e., the frequency of n in A245499. (End)

Records occur for n = 1, 3, 6, 8, 18, 32, 72, 200, ... where a(n) is 1, 2, 3, 5, 7, 9, 13, 19, ... respectively.

Examples

			8 occurs in rows 3, 5, 6, 7 and 8 being respectively [3, 6, 8], [5, 8, 10], [6, 8, 12], [7, 8, 14] and [8, 10, 12, 15]. These are 5 rows so a(8) = 5.
		

Links

• David A. Corneth, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A006255, A092487, A245499.