A390008 - OEIS

A390008

Smallest number which can be represented as a sum of two distinct nontrivial powers in exactly n ways.

12, 36, 153, 468, 1625, 2628, 12025, 32045, 27625, 138125, 430625, 204425, 160225, 2010025, 2348125, 801125, 1743625, 2082925, 4978025, 4005625, 12325625, 30525625, 27636050, 5928325, 13287625, 46437625, 45177925, 35409725, 120737825, 52073125, 66438125, 29641625, 32846125

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

OFFSET

1,1

LINKS

Michael S. Branicky, Table of n, a(n) for n = 1..51

Michael S. Branicky, Table of n, a(n) for all terms <= 10^10 (missing terms > 10^10 shown as -1)

Michael S. Branicky, Python program for OEIS A390008

EXAMPLE

a(1) = 12 = 2^3 + 2^2.

a(2) = 36 = 2^5 + 2^2 = 3^3 + 3^2.

a(3) = 153 = 3^2 + 12^2 = 5^2 + 2^7 = 2^5 + 11^2.

PROG