On 8/26/18 5:40 PM, Dennis Lee Bieber wrote:
> But their definition is still confusing as it is formulated with a
> expression as the argument to a().
>
> Taken literally, it says for n+4 to call a() with an argument of 8 (2n)
> AND to call it with an argument of 7 (2n-1) (returning two
On 8/26/18 4:20 PM, Musatov wrote:
> My understanding is this: there are an infinite number of n's that are not
> multiples of three, and yet will always be divisible by at least one of 22
> primes for all values of k.
>
> i.e. certain n values make the equation produce only composite numbers for
On Sunday, August 26, 2018 at 3:21:08 PM UTC-5, Musatov wrote:
> On Sunday, August 26, 2018 at 3:07:41 PM UTC-5, Oscar Benjamin wrote:
> > On Sun, 26 Aug 2018 at 20:32, Musatov wrote:
> > >
> > > On Sunday, August 26, 2018 at 2:14:29 PM UTC-5, Oscar Benjamin wrote:
> > > > > > > > > >> On Fri, 24
On Sunday, August 26, 2018 at 3:13:00 PM UTC-5, Oscar Benjamin wrote:
> On Sun, 26 Aug 2018 at 20:52, Musatov wrote:
> >
> > Thank you, Richard. If anyone is interested further, even in writing a
> > Python code to generate the sequence or further preparing of an animation I
> > would be delight
On Sunday, August 26, 2018 at 3:07:41 PM UTC-5, Oscar Benjamin wrote:
> On Sun, 26 Aug 2018 at 20:32, Musatov wrote:
> >
> > On Sunday, August 26, 2018 at 2:14:29 PM UTC-5, Oscar Benjamin wrote:
> > > > > > > > >> On Fri, 24 Aug 2018 14:40:00 -0700, tomusatov wrote:
> > > > > > > > >>
> > > > > >
On Sun, 26 Aug 2018 at 20:52, Musatov wrote:
>
> Thank you, Richard. If anyone is interested further, even in writing a Python
> code to generate the sequence or further preparing of an animation I would be
> delighted.
It would not take long to write code to plot your sequence if you
first cov
On Sun, 26 Aug 2018 at 20:32, Musatov wrote:
>
> On Sunday, August 26, 2018 at 2:14:29 PM UTC-5, Oscar Benjamin wrote:
> > > > > > > >> On Fri, 24 Aug 2018 14:40:00 -0700, tomusatov wrote:
> > > > > > > >>
> > > > > > > >>> I am looking for a program able to output a set of integers
> > > > > > >
On Sunday, August 26, 2018 at 2:35:13 PM UTC-5, Richard Damon wrote:
> On 8/26/18 1:58 PM, Musatov wrote:
> > On Sunday, August 26, 2018 at 12:49:16 PM UTC-5, Richard Damon wrote:
> >> On 8/26/18 12:48 PM, Dennis Lee Bieber wrote:
> The sequence is defined by:
>
> For 1 <= n <= 3, a(
On 8/26/18 1:58 PM, Musatov wrote:
> On Sunday, August 26, 2018 at 12:49:16 PM UTC-5, Richard Damon wrote:
>> On 8/26/18 12:48 PM, Dennis Lee Bieber wrote:
The sequence is defined by:
For 1 <= n <= 3, a(n) = n; thereafter, a(2n) = a(n) + a(n+1), a(2n-1) =
a(n) + a(n-2).
>>> I
On Sunday, August 26, 2018 at 2:14:29 PM UTC-5, Oscar Benjamin wrote:
> On Sat, 25 Aug 2018 at 20:27, Musatov wrote:
> >
> > On Saturday, August 25, 2018 at 2:18:09 PM UTC-5, Musatov wrote:
> > > On Saturday, August 25, 2018 at 1:52:17 PM UTC-5, Oscar Benjamin wrote:
> > > > > > >
> > > > > > >> O
On Sat, 25 Aug 2018 at 20:27, Musatov wrote:
>
> On Saturday, August 25, 2018 at 2:18:09 PM UTC-5, Musatov wrote:
> > On Saturday, August 25, 2018 at 1:52:17 PM UTC-5, Oscar Benjamin wrote:
> > > > > >
> > > > > >> On Fri, 24 Aug 2018 14:40:00 -0700, tomusatov wrote:
> > > > > >>
> > > > > >>> I a
On Sunday, August 26, 2018 at 12:49:16 PM UTC-5, Richard Damon wrote:
> On 8/26/18 12:48 PM, Dennis Lee Bieber wrote:
> >> The sequence is defined by:
> >>
> >> For 1 <= n <= 3, a(n) = n; thereafter, a(2n) = a(n) + a(n+1), a(2n-1) =
> >> a(n) + a(n-2).
> >>
> > Confusing explanation -- do you
On 8/26/18 12:48 PM, Dennis Lee Bieber wrote:
>> The sequence is defined by:
>>
>> For 1 <= n <= 3, a(n) = n; thereafter, a(2n) = a(n) + a(n+1), a(2n-1) = a(n)
>> + a(n-2).
>>
> Confusing explanation -- do you really mean that for n>=4 you are
> returning TWO values? If so, it is not a stric
I have an integer sequence of a fractal nature and want to know if it is
possible to write a program to illustrate it in a manner similar to the many
animated Mandelbrot illustrations.
The sequence is defined by:
For 1 <= n <= 3, a(n) = n; thereafter, a(2n) = a(n) + a(n+1), a(2n-1) = a(n) +
a(
14 matches
Mail list logo
