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.

A087317 Duplicate of A086489.

Original entry on oeis.org

2, 3, 2, 3, 2, 5, 14, 3, 2, 3, 2, 5, 21, 3, 2, 3, 2, 5, 8, 3, 2, 7, 10, 5, 10, 3, 2, 3, 2, 7, 15, 5, 6
Offset: 1

Views

Author

Keywords

A113456 Square array read by antidiagonals: a(n, d) is the smallest number that begins an arithmetic progression with common difference d of n numbers with the same prime signature.

Original entry on oeis.org

1, 2, 1, 33, 3, 1, 19940, 3, 2, 1, 204323, 213, 155, 3, 1, 380480345, 213, 7572, 3, 2, 1
Offset: 1

Views

Author

David Wasserman, Jan 08 2006; corrected Jan 08 2006

Keywords

Comments

First two columns are A034173 and A113457. First three rows are A000012, A086489 and A113458.

Examples

			a(3, 2) = 3 because 3, 5 and 7 have the same prime signature.
		

A085876 Smallest k such that k and k+n have the same prime signature that is different from all previous terms.

Original entry on oeis.org

2, 18, 35, 66, 4, 84, 344, 1692, 1785, 270, 4293, 1176, 9315, 1458, 3450, 5304, 2656, 10332, 8, 1352, 13344, 73040, 190762, 28812, 128180, 77248, 51948, 43092, 196, 35880, 287469, 85968, 387552, 83072, 412300, 45864, 247131, 549250, 1713855, 714960, 898816, 266448
Offset: 1

Views

Author

Amarnath Murthy, Jul 07 2003

Keywords

Examples

			a(1) = 2, as 2 and 2+1 = 3 both are primes.
a(2) = 18, 18 and 18+2 = 20 have the prime signature p^2*q.
a(4) = 66 as 66 + 4 = 70, both have prime signature p*q*r which has not occurred earlier.
a(19) = 8 as 8+19 = 27 and 8 and 27 have the same prime signature p^3.
		

Crossrefs

Cf. A086489.

Programs

  • PARI
    used = vector(42); ps(n) = local(f); f = factor(n); vecsort(f[,2]);
    a(n) = local(P, m, v, found, j); P = vector(n, i, ps(i)); m = 1; while (1, for (i = 1, n, v = ps(m*n + i); if (v == P[i], found = 0; j = 1; while (!found && j < n, if (v == used[j], found = 1, j++)); if (!found, used[n] = v; return((m - 1)*n + i))); P[i] = v); m++);
    for (i = 1, 42, print1(a(i), ", ")); \\ David Wasserman, Jul 19 2005

Extensions

More terms from Ray Chandler, Jul 11 2003
More terms from Ray Chandler, Jul 13 2003
More terms from Michel Marcus, Sep 23 2023
Showing 1-3 of 3 results.