@Carl Love Thanks for the comment, Carl.  I did not do a thorough search of the library.  Matt

@Ronan Thank you for this useful link.  The oral talk by Norman Robert was not all the way understood by me.  As far as I know ther is no written proof of the Goldbach conjecture.    For those not familiar, conjecture means probrably true.

Thank you again for the link.

@Carl Love thank you for a good comment Carl.

Here is a short Maple page summarizing the answers.

help_another_2.mw

Regards,

Matt

@tomleslie Thank you for your input about this 'Reverse and Add' sequence.  See https://oeis.org/A004086 for the 'R(n)' reverse sequence.

@BOverdorp Thank you for posting to MaplePrimes.  Although I am not able to answer your question, here is my attempt.  I was unaple to produce any good plots for you.

@vv Thank you for your input.  Maybee the expand() command can be helpful.  See help files.

Regards, Matthew

Hi MaplePrimes,

Here is a mathematical puzzle,
Find the next number -
3, 5, 8, 13, 22, ?
Here is an answer in Maple code -

a := Vector[row](9)

a[1] := 3; for i from 2 to 9 do a[i] := 2*a[i-1]-i+1 end do

a

***** end Maple code *****

[3,5,8,13,22,39 ... ]

Regards,

Matt

@Carl Love Thank you for making more code regarding this topic.  Unfortunately, I receive an error on my Maple 13 machine.  I see

Error, invalid arrow procedure

after the part that goes 
userinfo(
1, Lychrel,
(
there is a red box around
() -> if
I don't think I can fix this error.  
Maybee someone else can verify that this code works on newer Maple versions.

Also, see

oeis.org/A006960/

This is the Online Encyclopedia of Integer Sequences for this 196 sequence.
Regards,

Matt

Thanks Carl for the corrected procedure.

I needed to make one minor change probarably due to the fact that I use Maple 13.

Here is the code - 

cs := proc (N::posint)::nonnegint;
local n::posint, q::posint, r::(identical(0, 1)), count::nonnegint;
description "Find the number of steps for a Collatz sequence to reach 1.";
n := N;
for count from 0 while 1 < n do
q := iquo(n, 2, 'r');
n := `if`(r = 0, q, 3*n+1) end do;
count
end proc

I'm glad the code works now.

Matt

@sand15

Ah yes, printf("%g\n",p) does the trick.

Regards,

Matt

okay,

I found the print() command is easier than printf().

Matt

Thank you to all who contributed to this question.  Knowing about the parameterization command should be usefull to me.