[seqfan] Re: How to enter sequences with many zeros

[Lars Blomberg]

Thank you all!

(Note to self: Remember to read the Style Sheet.)

/Lars

-----Ursprungligt meddelande-----
Från: SeqFan <seqfan-bounces at list.seqfan.eu> För Heinz, Alois
Skickat: den 1 mars 2019 18:03
Till: Sequence Fanatics Discussion list <seqfan at list.seqfan.eu>; israel at math.ubc.ca
Ämne: [seqfan] Re: How to enter sequences with many zeros


In most cases no exception is needed.

In the definition you can say 2n instead of n.

Examples:

A002851 Number of unlabeled trivalent (or cubic) connected graphs with 2n nodes.

A002872 Number of partitions of {1..2n} that are invariant under a permutation consisting of n 2-cycles.

Am 01.03.2019 um 17:52 schrieb israel at math.ubc.ca:
> The Style Sheet says:
>
> | If every second term is zero (A, 0, B, 0, C, 0, D, 0, E, ...) then |
> normally we | omit the zeros and list the sequence as A, B, C, D, E, ...
>
> However, there are exceptions, and a "geometric interpretation of n" 
> might be a good reason to make an exception.
>
> Robert
>
> On Mar 1 2019, Lars Blomberg wrote:
>
>> Hello SegFans,
>>
>>
>>
>> The sequence a(n) = 0, 1, 0, 5, 0, 9, 0, 87, . has nonzero values 
>> only for even n.
>>
>> Should the sequence be entered as above, or is 1, 5, 9, 87, . better?
>>
>>
>>
>> There is a geometric interpretation of n, in case that makes any 
>> difference.
>>
>>
>>
>> /Lars
>>
>>
>> --
>> Seqfan Mailing list - http://list.seqfan.eu/
>>
>>
>
> --
> Seqfan Mailing list - http://list.seqfan.eu/


--
Seqfan Mailing list - http://list.seqfan.eu/