OFFSET
1,1
COMMENTS
n | 2*m where m is a term in this sequence. - David A. Corneth, Oct 29 2018
LINKS
Hugh Erling, Table of n, a(n) for n = 1..100
Hugh Erling, Python code
EXAMPLE
561 has representations P(3, 188)=P(6, 39)=P(11, 12)=P(17, 6)=P(33, 3).
1485 has representations P(3, 496)=P(5, 150)=P(9, 43)=P(15, 16)=P(54, 3).
1701 has representations P(3, 568)=P(6, 115)=P(9, 49)=P(18, 13)=P(21, 10).
PROG
(PARI) isok(n) = sum(k=3, n-1, ispolygonal(n, k)) == 5; \\ Michel Marcus, Oct 29 2018
(PARI) is(n) = my(d=divisors(n<<1)); sum(i=2, #d, k=2*(d[i]^2 - 2 * d[i] + n) / (d[i] - 1) / d[i]; k == k\1 && min(d[i], k) >=3) == 5 \\ David A. Corneth, Oct 29 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
Hugh Erling, Oct 28 2018
STATUS
approved