[seqfan] Sturdy and flimsy numbers.

[Antti Karttunen]

Cheers,

I followed an A-number from one frame of the OEIS movie,
and found this:
http://www.research.att.com/~njas/sequences/A125121


Just wondering, how well-defined this kind of sequence is?

That is, is there some absolute upper limit of k for each n,
after which the program can finish the testing loop?

And BTW, this is just "the kettle blaming the casserole", or something like
that,
as I have created my own
http://www.research.att.com/~njas/sequences/A115857
on similar shaky foundations.

(One would like also to compute the setwise difference A115857 \ A065621.
It is clear that for all n in A065621 such solutions exist.)



Yours,

Antti Karttunen