Sequences needing more terms: high-value targets?

[Maximilian Hasler]

Sorry, copy-paste error:
The terms computed in 1 millisecond are those of
http://www.research.att.com/~njas/sequences/A094357
(They are of the form k^2-1)

Those of http://www.research.att.com/~njas/sequences/A058429 :
needed 30 minutes (and their square have only {0,3,4}).

Apologies,
Maximilian Hasler

On 5/15/07, Jon Schoenfield <jonscho at hiwaay.net> wrote:
> Pardon me for jumping in ... but I'm not understanding something here.
>
> > This is as I understand it also. However, sometimes one fails to
> > remark a simple pattern. E.g. for
> > http://www.research.att.com/~njas/sequences/A058429 :
> > I suspect that the next terms are
> > 32645356640144805339103579127542660095683,
> > 1065719310162246533488642668727242229836115845084364968718962458406456800068819599
>
> How could this be?  A058429 is defined as "Numbers n such that n^2 contains
> only digits {0,3,4}, not ending with zero" ... but the square of each of
> these two proposed terms begins with the digit 1.  (Was some other sequence
> than A058429 intended here?)
>
> Thanks,
>
> -- Jon
>
>
>