[seqfan] Re: Definition of A052130; question about Beatty sequences.

M. F. Hasler oeis at hasler.fr
Sun Apr 5 18:41:56 CEST 2015


If, for given n, you take m larger and larger, then from one point on the
result does not change any more. But for m too small, you get less.
For example, in order to have
" There are 2 numbers with m-1 prime factors (2^(m-1) and 3*2^(m-2)), so
a(1) = 2."
you must obviously have m >= 3, but for larger m you will not get more
results.
You can develop yourself the case n=3 etc to see how it works.

Maybe the alternate definition with the  half-primes, rephrased, would be
better...

Maximilian
Le 5 avr. 2015 03:33, "L. Edson Jeffery" <lejeffery2 at gmail.com> a écrit :

Can someone please explain why the condition "For m very large" is required
in the definition (%N) of A052130 (https://oeis.org/A052130)?

For adjacent terms in a Beatty sequence, are there always only two distinct
first differences, and is there a formula for determining the maximum
distance between adjacent terms?

Ed Jeffery

_______________________________________________

Seqfan Mailing list - http://list.seqfan.eu/



More information about the SeqFan mailing list