[seqfan] Re: Related to Collatz

[Frank Adams-Watters]

This is very similar to A114183. I don't think the proof there carries over here, however.

I think you should go ahead and submit the sequence.

Franklin T. Adams-Watters


-----Original Message-----
From: Melvin M Peralta <melvinmperalta at gmail.com>
To: seqfan <seqfan at list.seqfan.eu>
Sent: Tue, Feb 16, 2016 1:00 am
Subject: [seqfan] Related to Collatz

Hello SeqFans,a(1) = 1, a(2) = 2a(n + 1) = floor[sqrt(a(n))], if not already in the sequenceotherwise, a(n + 1) = a(n) + a(n - 1)It's a bit of Collatz and Fibonacci.Here are the first few terms:1, 2, 3, 5, 8, 13, 21, 4, 25, 29, 54, 7, 61, 68, 129, 11, 140, 151The biggest question is if it's an integer permutation. Thoughts on how toapproach? My guess is there's a good chance, since n will appear if n^2,n^4, n^8, and so on appear at any point.Are there too many sequences similar to this one? Worth adding to OEIS ornot interesting enough?Any other comments or questions that come out of this sequence are welcome!Best regards,Melvin_______________________________________________Seqfan Mailing list - http://list.seqfan.eu/