A396668 Number of primes p such that n is the smallest value of z for which there exists a solution to p = x*y+y*z+z*x in nonnegative integers x <= y <= z.

1, 2, 2, 1, 5, 2, 5, 4, 5, 3, 11, 1, 15, 5, 8, 4, 15, 4, 22, 7, 12, 9, 26, 5, 18, 8, 15, 9, 28, 2, 30, 8, 16, 11, 26, 11, 30, 15, 21, 11, 45, 11, 43, 13, 17, 15, 43, 7, 34, 14, 32, 23, 49, 8, 38, 15, 32, 18, 46, 8, 60, 22, 31, 18, 46, 12, 56, 22, 46, 14, 66, 10

Offset

1,2

Comments

a(n) is the number of primes p such that A396665(p) = n.

Links

Pontus von Brömssen, Table of n, a(n) for n = 1..10000

Formula

a(n) = A394353(n)-A394353(n-1).

Crossrefs

Cf. A394353, A396665, A396667.

Sequence in context: A123398 A277495 A188945 * A281261 A102849 A088333

Adjacent sequences: A396665 A396666 A396667 * A396669 A396670 A396671

Keyword

nonn

Author

Pontus von Brömssen, Jun 03 2026

Status

approved