[seqfan] Re: verifying A153063 with a(n)=a^2-n^a

[RGWv]

?Et al,

    The next term 
is: -1.642155991293887705947531213655414816023738489781202992764677529*10^3948835.

Bob.

-----Original Message----- 
From: Richard Mathar
Sent: Saturday, November 27, 2010 10:04 AM
To: seqfan at seqfan.eu
Cc: 4vladmir at gmail.com
Subject: [seqfan] verifying A153063 with a(n)=a^2-n^a


Help! I am running into problems with A153063 http://oeis.org/A153063 .
I thought a(-1)=1, a(n)=floor(a(n-1)^2-n^a(n-1)) with offset 0 would work,
with a glance at the Mma code. Basically the step 4 -> -2092 means one
would need to have some 16-(...)^4 to generate -2092, and that seems
to be impossible.

RJM


_______________________________________________

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