A358071 -id:A358071 - cp's OEIS frontend

Showing 1-1 of 1 results.

A359013 Numbers k that can be written as the sum of a perfect square and a factorial in exactly 3 distinct ways.

Original entry on oeis.org

145, 46249, 63121, 42916624, 18700677890064, 28112213204100, 41654823930457982576640000, 445860623276908458083942400, 666474080134036599385635225600

Offset: 1

Walter Robinson, Dec 11 2022

This does not count x^2 and (-x)^2 as distinct, nor does it count 0! and 1! as distinct.

a(10) > 10^30 if it exists. - David A. Corneth, Dec 11 2022

			145 = 5^2 + 5! = 11^2 + 4! = 12^2 + 1!.

Cf. A000142, A000290.

Subset of A358071.

import math
for x in range(1, 120000000):
    total = 0
    prod = 1
    factInc = 2
    while prod <= x:
        sq = math.sqrt(x - prod)
        if sq % 1 == 0:
            total = total + 1
        prod = prod * factInc
        factInc = factInc + 1
    if total == 3:
        print(x)

a(5)-a(9) from David A. Corneth, Dec 11 2022

Showing 1-1 of 1 results.