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.

A361639 For n > 1, A359804(n) is a multiple of A361503(n-1); a(n) = A359804(n) / A361503(n-1).

Original entry on oeis.org

1, 1, 1, 2, 2, 2, 1, 3, 4, 3, 2, 1, 4, 4, 3, 2, 5, 6, 4, 6, 3, 5, 8, 8, 8, 6, 4, 9, 7, 13, 9, 10, 8, 12, 11, 9, 16, 12, 10, 6, 1, 13, 17, 13, 15, 19, 11, 16, 16, 12, 8, 17, 17, 23, 18, 13, 9, 26, 19, 18, 14, 20, 19, 15, 29, 10, 23, 16, 23, 24, 17, 24, 11, 18
Offset: 2

Views

Author

Rémy Sigrist, Mar 19 2023

Keywords

Examples

			a(10) = A359804(10) / A361503(9) = 8 / 2 = 4.
		

Crossrefs

Programs

  • C
    See Links section.
  • Mathematica
    nn = 120; c[] = False; q[] = 1;
    i = 1; j = 2; c[1] = c[2] = True; u = 3;
    {1}~Join~Reap[Do[
         (m = q[#]; While[c[m #], m++]; k = m #; q[#] = m) &[(p = 2;
           While[Divisible[i j, p], p = NextPrime[p]]; p)]; Sow[m];
         Set[{c[k], i, j}, {True, j, k}];
    If[k == u, While[c[u], u++]], {n, 3, nn}] ][[-1, -1]] (* Michael De Vlieger, Mar 19 2023 *)