A381620 a(n) is the number of solutions to the problem described in A381619 with smallest price equal to n.

50, 50, 12, 30, 25, 26, 8, 30, 9, 25, 5, 15, 2, 4, 13, 5, 2, 8, 3, 30, 3, 3, 1, 8, 25, 4, 1, 4, 2, 12, 0, 10, 2, 1, 5, 5, 0, 1, 0, 15, 2, 4, 1, 3, 8, 2, 1, 2, 0, 15, 1, 2, 0, 1, 2, 2, 0, 1, 1, 15, 1, 0, 2, 0, 3, 3, 1, 2, 2, 5, 1, 6, 1, 2, 9, 3, 1, 0, 0, 5, 1, 4

Offset: 1

Author

Hugo Pfoertner, Mar 12 2025

Keywords

• nonn
• fini
• full

Examples

			a(13) = 2 because there are 2 triples {x,y,z} satisfying 100^2*(x+y+z)=x*y*z with x=13:
  {13, 770, 783000} and {13, 800, 20325};
a(23) = 1: {23, 435, 416000} is the only triple with smallest term 23: 10000*(23+435+916000) = 23*435*916000 = 9164580000 = 10000*A381619(578).
		

Links

• Hugo Pfoertner, Table of n, a(n) for n = 1..150
• Hugo Pfoertner, Solution triples sorted by smallest price. (2025)

Crossrefs

Cf. A380887, A381187, A381619.