[seqfan] Re: A344826

M. F. Hasler oeis at hasler.fr
Sat Jun 12 20:19:23 CEST 2021

On Sat, Jun 12, 2021, 13:44 <michel.marcus at free.fr> wrote:

> Well, I see several reasons:
> 90 terms for A344826 and A343886 is not much;

Yes, but now that the underlying sequence oeis.org/A097621 (replace the
n-th prime power by n), although quite "old",
is referenced only 6 times: in sequences A097622(n)=A097621(A097621(n)) and
A097623(n)=A097621(A097621(A097621(n))) (no comment...),
in this very recent sequence (A097621(n) | n) and the derived A343886 (the
and one other i forgot.

And it looks a bit artificial: for example, if the list of prime powers
would have the possibly more natural indexing offset 0 instead of 1, *all*
these sequence would be *totally* different. Which might be considered as a
"proof" that they don't have a real meaning.  (I don't mean to offense,
just saying... :-))

But of course one can do the computing exercise just for fun!

- Maximilian

2*10^8 is not that big too.
> they are similar to A127724 and so somehow to A127724 (but of course, with
> a different function).
> my pari script is limited to the allocatemem I can do, maybe someone has
> better.
> I tried to save the underlying data in files to counteract my memory
> limitation but when n increase, it kept switching files, so it did not work.

More information about the SeqFan mailing list