[seqfan] Re: submitting sequences with sets as terms

[Neil Sloane]

Bob,
Alonso already answered your question, but here are some further remarks:

There are 4 standard ways to do that:

1.  Sequence giving smallest prime divisor of a(n).

2.  Sequence giving largest prime divisor of a(n).

3.  Sequence listing the distinct primes dividing a(n), in increasing
order, as an irregular triangle, with keyword tabf, as in Alonso's reply.
In this case that would be
2, 3, 2,3, 2, 3,5, ...

4. Sequence listing all primes dividing a(n), with repetition, in
increasing order, as an irregular triangle, with keyword tabf, as in
Alonso's reply. In this case that would be
2,3,2,2,3,3,2,2,2,3,5,...



Best regards
Neil

Neil J. A. Sloane, President, OEIS Foundation.
11 South Adelaide Avenue, Highland Park, NJ 08904, USA.
Also Visiting Scientist, Math. Dept., Rutgers University, Piscataway, NJ.
Phone: 732 828 6098; home page: http://NeilSloane.com
Email: njasloane at gmail.com


On Sat, Mar 21, 2015 at 3:26 PM, Bob Selcoe <rselcoe at entouchonline.net>
wrote:

>
> Hi Seqfans,
>
> I was hoping for some clarification about submitting sequences with sets
> as terms.
>
> For instance, the sequence of prime factors of A098550(n) n>1 is  {2}, {3}
> {2}, {3}, {2}, {3,5}, {2,7}, {5}, {2,3}...
>
> Is there a preferred format for such sequences?
>
> Thanks in advance,
> Bob Selcoe
> PS - is there a page on the site which addresses this? I couldn't find it
> from the OEIS Wiki page.
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>