login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A068796 Maximum k such that k consecutive integers starting at n have distinct numbers of prime factors (counted with multiplicity). 3
2, 1, 2, 2, 2, 3, 3, 2, 1, 3, 2, 3, 2, 1, 4, 3, 2, 2, 3, 2, 1, 3, 3, 2, 1, 2, 1, 2, 2, 4, 3, 2, 1, 1, 3, 3, 2, 1, 4, 3, 2, 2, 2, 1, 4, 3, 4, 3, 2, 2, 4, 4, 3, 2, 2, 2, 1, 3, 2, 5, 4, 3, 3, 4, 3, 2, 3, 2, 4, 3, 2, 4, 3, 2, 1, 2, 5, 5, 4, 4, 3, 3, 3, 2, 1, 1, 3, 2, 4, 3, 2, 2, 1, 1, 4, 3, 2, 1, 3, 3, 2, 3, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
The number of prime factors (counted with multiplicity) of n is bigomega(n) = A001222(n).
LINKS
EXAMPLE
a(6)=3 because 6, 7, 8 and 9 have, respectively, 2, 1, 3 and 2 prime factors; the first 3 of these are distinct.
MATHEMATICA
bigomega[n_] := Plus@@Last/@FactorInteger[n]; a[n_] := For[k=1; s={bigomega[n]}, True, k++, If[MemberQ[s, z=bigomega[n+k]], Return[k], AppendTo[s, z]]]
ss={}; Do[s={PrimeOmega[n]}; k=1; While[FreeQ[s, (b=PrimeOmega[n+k])], s=AppendTo[s, b]; k++]; ss=AppendTo[ss, k], {n, 103}]; (* Zak Seidov, Nov 09 2015 *)
CROSSREFS
Sequence in context: A025807 A120254 A263020 * A154804 A207642 A053276
KEYWORD
nonn
AUTHOR
Dean Hickerson, Mar 05 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 16:38 EDT 2024. Contains 371794 sequences. (Running on oeis4.)