[seqfan] Re: Perhaps interesting sequence

[Aai]

I'm not sure what you mean.Let me elaborate:

n mod floor(sqrt(n))

calculates an index of the sequencee.g.:

0 0 0 0 1 0 1 0 0 1 2 0 1 2 0 0 1 2 3 0 1 2 3 0

and they are easily generated without calculations:

0
0
0
0 1
0 1
0
0 1 2
0 1 2
0
0 1 2 3
0 1 2 3
0
...

etc.

That is to say if the resulting sequence is as follows:

0 1 1 1 1 2 1 2 1 1 2 2 1 2 2 1 1 2 2 2 1 2 2 2 1 ...


Thanks



On 01-12-13 04:25, W. Edwin Clark wrote:
> It seems to me that a(1)  = a(0 mod 0)+1 should be 1 and not 0. This
> assumes that 0 mod 0 = 0 which perhaps logical since when n = 0, Z/nZ =
> Z/(0) is isomorphic to Z.
>
>
> On Sat, Nov 30, 2013 at 2:06 PM, Aai <agroeneveld400 at gmail.com> wrote:
>
>> If I'm not wrong this seq is based on a easy index pattern
>>
>> 0 0  0  0 1 0 1  0  0 1 2 0 1 2  0  0 1 2 3 0 1 2 3  0  0 1 2 3 4 0 1 2 3 4
>> ---     -------     -----------     --------------- -------------------
>>
>> On 30-11-13 17:34, David Wilson wrote:
>>
>>> Define
>>>
>>>
>>> a(0) = 0; a(n+1) = a(n mod floor(sqrt(n))) + 1;
>>>
>>>
>>> This sequence grows slowly, the first appearance of a(n) = k seems to be
>>> at
>>> n = A000058(n) - 2.
>>>
>>>
>>> _______________________________________________
>>>
>>> Seqfan Mailing list - http://list.seqfan.eu/
>>>
>> --
>> Met vriendelijke groet,
>> @@i = Arie Groeneveld
>>
>>
>> _______________________________________________
>>
>> Seqfan Mailing list - http://list.seqfan.eu/
>>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/

-- 
Met vriendelijke groet,
@@i = Arie Groeneveld