cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A152492 a(n) = number of integers of the form (n*k)^2/(k^2 - n^2).

Original entry on oeis.org

0, 0, 1, 1, 0, 2, 0, 1, 1, 1, 0, 8, 0, 0, 4, 1, 0, 2, 0, 4, 3, 0, 0, 9, 0, 0, 1, 2, 0, 7, 0, 1, 2, 0, 1, 8, 0, 0, 1, 4, 0, 5, 0, 1, 5, 0, 0, 9, 0, 1, 1, 1, 0, 2, 1, 4, 1, 0, 0, 23, 0, 0, 3, 1, 1, 4, 0, 1, 1, 2, 0, 10, 0, 0, 4, 1, 0, 4, 0, 4, 1, 0, 0, 17, 0, 0, 1, 1, 0, 8
Offset: 1

Views

Author

Ctibor O. Zizka, Dec 06 2008

Keywords

Comments

k needs to be checked only up through n^2+1 since beyond this n^2 < (n*k)^2/(k^2 - n^2) < n^2 + 1 and thus can't be an integer. - Micah Manary, Aug 27 2022

Crossrefs

Programs

  • PARI
    a(n) = sum(k=1, n^2+1, if (k!=n, denominator((n*k)^2/(k^2 - n^2))==1)); \\ Michel Marcus, Oct 28 2022

Extensions

More terms from Micah Manary, Aug 07 2022

A152491 Numbers n such that 1/c = 1/n + 1/S(n). c, n positive integers (A000027(n)), S(n) sum of digits of n (A007953(n)).

Original entry on oeis.org

2, 4, 6, 8, 18, 72
Offset: 1

Views

Author

Ctibor O. Zizka, Dec 06 2008

Keywords

Comments

A000027(n)*A007953(n)/(A000027(n)+A007953(n))= c, c positive integer.
No further term < 10000000. - Michel Marcus, Jun 02 2013
For a given n let x be the minimal natural number such that n*x/(n+x)=c. I conjecture: from a certain n onward, x>S(n) for all n. Thus there is no other solution bigger than 72, and this sequence is finite. - Ctibor O. Zizka, Sep 13 2015
Sequence is complete. To prove it, let s denote the sum of digits of n and observe that 1/c - 1/s = 1/n is equivalent to (s-c)/(c*s) = 1/n. Hence we must have s > c and c*s >= n, otherwise the denominators cannot match. But if n is greater than, say, 1000, it is easy to see that s^2 < n and this implies c*s < n, since c < s. - Giovanni Resta, Sep 13 2015

Crossrefs

Programs

  • PARI
    lista(nn) = {for (n=1, nn, digs = Vec(Str(n)); sn = sum(i=1, #digs, eval(digs[i])); if (type(1/(1/n+1/sn)) == "t_INT", print1(n, ", ")););} \\ Michel Marcus, Jun 02 2013
Showing 1-2 of 2 results.