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-3 of 3 results.

A063428 a(n) is the smallest positive integer of the form n*k/(n+k).

Original entry on oeis.org

1, 2, 2, 4, 2, 6, 4, 6, 5, 10, 3, 12, 7, 6, 8, 16, 6, 18, 4, 12, 11, 22, 6, 20, 13, 18, 12, 28, 5, 30, 16, 22, 17, 10, 9, 36, 19, 26, 8, 40, 6, 42, 22, 18, 23, 46, 12, 42, 25, 34, 26, 52, 18, 30, 7, 38, 29, 58, 10, 60, 31, 14, 32, 40, 22, 66, 34, 46, 20, 70, 8, 72, 37, 30, 38, 28, 26
Offset: 2

Views

Author

Henry Bottomley, Jul 19 2001

Keywords

Comments

Or, smallest b such that 1/n + 1/c = 1/b has integer solutions.
Largest b is (n-1) since 1/n + 1/(n(n-1)) = 1/(n-1).
a(n) = smallest k such that k*n/(k-n) is an integer. - Derek Orr, May 29 2014

Examples

			a(6) = 2 because 6*3/(6+3) = 2 is the smallest integer of the form 6*k/(6+k).
a(10) = 5 since 1/10 + 1/10 = 1/5, 1/10 + 1/15 = 1/6, 1/10 + 1/40 = 1/8, 1/10 + 1/90 = 1/9 and so the first sum provides the value.

Links

Crossrefs

Cf. A018892, A063427, A127730, A063647, A063648, A063649, A066092.

Programs

  • Mathematica
    spi[n_]:=Module[{k=1},While[!IntegerQ[(n*k)/(n+k)],k++];(n*k)/(n+k)]; Array[ spi,80,2] (* Harvey P. Dale, May 05 2022 *)
  • PARI
    a(n)={my(k=1); if(n>1, while (n*k%(n + k), k++); n*k/(n + k))} \\ Harry J. Smith, Aug 20 2009

Formula

a(n) = n*A063427(n)/(n + A063427(n)) = 2n - A063649(n).
If n is prime a(n) = n - 1. - Benoit Cloitre, Dec 31 2001

Extensions

New description from Benoit Cloitre, Dec 31 2001
Entry revised by N. J. A. Sloane, Feb 13 2007
Definition revised by Franklin T. Adams-Watters, Aug 07 2009

A063717 a(n) is the greatest divisor of n^2 that is less than n.

Original entry on oeis.org

1, 1, 2, 1, 4, 1, 4, 3, 5, 1, 9, 1, 7, 9, 8, 1, 12, 1, 16, 9, 11, 1, 18, 5, 13, 9, 16, 1, 25, 1, 16, 11, 17, 25, 27, 1, 19, 13, 32, 1, 36, 1, 22, 27, 23, 1, 36, 7, 25, 17, 26, 1, 36, 25, 49, 19, 29, 1, 50, 1, 31, 49, 32, 25, 44, 1, 34, 23, 50, 1, 64, 1, 37, 45, 38, 49, 52, 1, 64, 27, 41
Offset: 2

Views

Author

Vladeta Jovovic, Aug 12 2001

Keywords

Comments

Smaller of two distinct numbers with minimum sum whose geometric mean is n. E.g., a(12) = 9 as 12^2 = 144 = 1*144 = 2*72 = 3*48 = 4*36 = 6*24 = 8*18 = 9*16, etc. - Amarnath Murthy, Feb 15 2003

Examples

			a(45)=27 because set of divisors of 45^2 is {1, 3, 5, 9, 15, 25, 27, 45, 75, 81, 135, 225, 405, 675, 2025} and the greatest element of the set less than 45 is 27.

Links

Crossrefs

A063649(n) = n + a(n), A063718(n) = n^2/A063717(n), A063428(n) = n - a(n).
Cf. A063718.

Programs

  • Maple
    with(numtheory): for n from 2 to 200 do a := divisors(n^2): b := a[(tau(n^2)-1)/2]: printf(`%d,`,b); od:
  • Mathematica
    f[n_] := Module[{dn2 = Divisors[n^2]}, Last[Take[dn2, {1, Flatten[Position[dn2, n]][[ 1]] - 1}]]]; Table[f[i], {i, 2, 85}]
Table[Select[Divisors[n^2],#Harvey P. Dale, Apr 23 2016 *)
  • PARI
    { for (n=2, 1000, d=divisors(n^2); write("b063717.txt", n, " ", d[length(d)\2]) ) } \\ Harry J. Smith, Aug 28 2009

A063648 Smallest c such that 1/n=1/c+1/b has integer solutions with c>b.

Original entry on oeis.org

6, 12, 12, 30, 15, 56, 24, 36, 30, 132, 28, 182, 42, 40, 48, 306, 45, 380, 45, 70, 66, 552, 56, 150, 78, 108, 77, 870, 66, 992, 96, 132, 102, 84, 84, 1406, 114, 156, 90, 1722, 91, 1892, 132, 120, 138, 2256, 112, 392, 150, 204, 156, 2862, 135, 176, 120, 228, 174
Offset: 2

Views

Author

Henry Bottomley, Jul 23 2001

Keywords

Comments

Largest c is n(n+1) since 1/n=1/(n(n+1))+1/(n+1)

Examples

			a(10)=30 since 1/10=1/20+1/20=1/30+1/15=1/35+1/14=1/60+1/12=1/110+1/11, but the first sum does not have c>b, leaving the second sum to provide the value.

Crossrefs

Cf. A018892, A063427, A063428, A063647, A063649.

Formula

a(n) =n*A063649(n)/(A063649(n)-n) =A063427(n)+2n.
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.