login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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). 2
2, 1, 6, 15, 60, 726, 6318, 189375, 755968, 683441871, 33714015615 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

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?

REFERENCES

J.-M. De Koninck, J. B. Friedlander, and F. Luca, On strings of consecutive integers with a distinct number of prime factors, Proc. Amer. Math. Soc., 137 (2009), 1585-1592.

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]]]

CROSSREFS

Cf. A001222, A067665, A068796.

Sequence in context: A002562 A136456 A123968 * A049951 A025263 A097947

Adjacent sequences:  A068794 A068795 A068796 * A068798 A068799 A068800

KEYWORD

more,nonn

AUTHOR

Dean Hickerson (dean.hickerson(AT)yahoo.com), Mar 05 2002

EXTENSIONS

a(11) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Oct 15 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 16 09:56 EST 2012. Contains 205904 sequences.