[seqfan] Sturdy and flimsy numbers.
antti.karttunen at gmail.com
Sun Dec 20 18:57:27 CET 2009
I followed an A-number from one frame of the OEIS movie,
and found this:
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
as I have created my own
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.)
More information about the SeqFan