[seqfan] Re: Barriers for omega(n)

[W. Edwin Clark]

>From the reference:   R. K. Guy, Unsolved Problems in Number Theory, B8.

omega(n) is the number of distinct prime factors of n
and n is a barrier for a number theoretic function f if for all m < n, m +
f(m) <= n.
The question is raised: does omega have infinitely many barriers?

On Wed, Sep 19, 2012 at 10:35 PM, Charles Greathouse <
charles.greathouse at case.edu> wrote:

> A005236 is called "Barriers for omega(n)." but no further description
> is given. What is the definition of this sequence? It sounds
> interesting.
>
> I can see something number-theoretical going on in the terms, but I
> can't quite piece it together...
>
> Charles Greathouse
> Analyst/Programmer
> Case Western Reserve University
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>