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
%I A068797
%S A068797 2,1,6,15,60,726,6318,189375,755968,683441871,33714015615
%N 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).
%C A068797 The number of prime factors (counted with multiplicity) of n is bigomega(n) 
               = A001222(n).
%C A068797 The known terms, except for the first, agree with A067665. Is that true 
               forever?
%t A068797 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]]]
%Y A068797 Cf. A001222, A067665, A068796.
%Y A068797 Sequence in context: A002562 A136456 A123968 this_sequence A049951 A025263 
               A097947
%Y A068797 Adjacent sequences: A068794 A068795 A068796 this_sequence A068798 A068799 
               A068800
%K A068797 more,nonn
%O A068797 1,1
%A A068797 Dean Hickerson (dean.hickerson(AT)yahoo.com), Mar 05 2002
%E A068797 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 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research