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.

A139694 a(0)=1. a(n) = smallest positive integer m, m > a(n-1), where, for k divides m, minimum(|k -m/k|) = n. a(n) = the minimum positive integer m where A056737(m) = n and m > a(n-1).

Original entry on oeis.org

1, 2, 3, 10, 21, 50, 55, 78, 105, 136, 171, 242, 253, 338, 351, 406, 465, 578, 595, 666, 741, 820, 903, 1058, 1081, 1250, 1275, 1378, 1653, 1682, 1711, 1830, 1953, 2178, 2211, 2556, 2701, 2738, 2775, 2926, 3081, 3362, 3403, 3698, 3741, 3916, 4232, 4418, 4465
Offset: 0

Views

Author

Leroy Quet, Apr 29 2008

Keywords

Crossrefs

Programs

  • PARI
    a056737(n)={n=divisors(n); n[(2+#n)\2]-n[(1+#n)\2];} \\ from A056737
    lista(nn) = {olda = 1; for (n=1, nn+1, print1(olda, ", "); newa = olda + 1; while (a056737(newa) != n, newa++); olda = newa;);} \\ Michel Marcus, Feb 11 2014

Extensions

More terms from Michel Marcus, Feb 11 2014