Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068797
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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). +0
3
2, 1, 6, 15, 60, 726, 6318, 189375, 755968, 683441871, 33714015615 (list; graph; listen)
OFFSET

1,1

COMMENT

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?

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 this_sequence A049951 A025263 A097947

Adjacent sequences: A068794 A068795 A068796 this_sequence 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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 3 22:15 EST 2009. Contains 170310 sequences.


AT&T Labs Research