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.

A068797 Minimum x such that f(x)=n, where f(x)=A068796(x) is the maximum k such that k consecutive integers starting at x have distinct numbers of prime factors (counted with multiplicity).

Original entry on oeis.org

2, 1, 6, 15, 60, 726, 6318, 189375, 755968, 683441871, 33714015615
Offset: 1

Views

Author

Dean Hickerson, Mar 05 2002

Keywords

Comments

The number of prime factors (counted with multiplicity) of n is bigomega(n) = A001222(n).
The known terms, except for the first, agree with A067665. Is that true forever?

Crossrefs

Programs

  • Mathematica
    bigomega[n_] := Plus@@Last/@FactorInteger[n]; f[n_] := For[k=1; s={bigomega[n]}, True, k++, If[MemberQ[s, z=bigomega[n+k]], Return[k], AppendTo[s, z]]]; a[n_] := For[x=1, True, x++, If[f[x]==n, Return[x]]]

Extensions

a(11) from Donovan Johnson, Oct 15 2008