A346460 - OEIS

A346460

Square array read by downward antidiagonals in which row n lists all numbers k for which all positive integers cannot be colored with two colors without any positive integer x being the same color as n*x or k*x (for n >= 2).

4, 16, 9, 64, 81, 2, 256, 729, 8, 25, 1024, 6561, 16, 625, 36, 4096, 59049, 32, 15625, 1296, 49, 16384, 531441, 128, 390625, 46656, 2401, 4, 65536, 4782969, 256, 9765625, 1679616, 117649, 16, 3, 262144, 43046721, 512, 244140625, 60466176, 5764801, 64, 27, 100

(list; table; graph; refs; listen; history; text; internal format)

OFFSET

2,1

COMMENTS

Row n lists all positive integers k for which there exists at least one pair of positive integers (x, y) such that n^x = k^y and x+y is odd.

If n is an element of A007916, then row n lists all perfect powers of n^2.

A positive integer k is in row n if and only if there exists a positive integer x for which A052410(n)^x = k and A007814(A052409(n)) != A007814(x).

LINKS

Table of n, a(n) for n=2..46.

M. Eren Kesim, First Python program for A346460

M. Eren Kesim, Second Python program for A346460

EXAMPLE