|
|
A243046
|
|
Number of solutions to k*n/(k+n) = x and k*n/(k-n) = y for integers x and y and natural number k.
|
|
6
|
|
|
0, 0, 1, 1, 0, 2, 0, 1, 1, 1, 0, 5, 0, 0, 3, 1, 0, 2, 0, 2, 2, 0, 0, 7, 0, 0, 1, 2, 0, 5, 0, 1, 1, 0, 1, 6, 0, 0, 1, 4, 0, 4, 0, 1, 4, 0, 0, 7, 0, 1, 1, 1, 0, 2, 1, 2, 1, 0, 0, 13, 0, 0, 3, 1, 0, 3, 0, 1, 1, 2, 0, 8, 0, 0, 3, 1, 0, 3, 0, 4, 1, 0, 0, 10, 0, 0, 1, 1, 0, 7, 1, 1, 1, 0, 0, 7, 0, 0, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,6
|
|
COMMENTS
|
Question: Is there any direct formula for this sequence? Cf. for example A146564. - Antti Karttunen, Feb 18 2023
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
6*k/(k-6) and 6*k/(k+6) are integers for k = 3 (-6 and 2, respectively) and k = 12 (12 and 4, respectively). Thus a(6) = 2.
|
|
PROG
|
(PARI) a(n)={t=0; for(k=1, n*(n+1), if(k!=n, if((k*n)%(k+n)==0&&(k*n)%(k-n)==0, t+=1))); return(t)} \\ - Typo corrected by Antti Karttunen, Feb 18 2023
n=1, while(n<100, print1(a(n), ", "); n+=1)
(PARI) A243046(n) = sum(k=1, n*(n+1), (k!=n && !((k*n)%(k+n)) && !((k*n)%(k-n)))); \\ Antti Karttunen, Feb 18 2023
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|