[seqfan] Re: In the vein of 103314

[David Wilson]

Sometimes, if a poster shows signs of criminal ill-consideration or sloppiness, it can be cute to call them on it.
But if a problem is correctly posed, or cumbersome details omitted for brevity, the Captain Obvious thing can be, well, irritating.
This from someone who, at one time, never missed the chance to apply a rapier wit to the slightest misstep.
These days, however, I tend to look for the meat on the plate.

That being said, regarding the original question

	a(n) = number of distinct sums of n nth roots of 1.

I find, starting at index 1:

	a = (1, 3, 10, 25, ...)

We certainly have

	a(n) == 1 (mod n).


> -----Original Message-----
> From: SeqFan [mailto:seqfan-bounces at list.seqfan.eu] On Behalf Of
> Emmanuel Vantieghem
> Sent: Wednesday, December 20, 2017 6:04 AM
> To: Sequence Fanatics Discussion list
> Subject: [seqfan] Re: In the vein of 103314
> 
> If these roots are different, there is only one possible value : 0
> 
> <http://www.avg.com/email-
> signature?utm_medium=email&utm_source=link&utm_campaign=sig-
> email&utm_content=webmail>
> Virusvrij.
> www.avg.com
> <http://www.avg.com/email-
> signature?utm_medium=email&utm_source=link&utm_campaign=sig-
> email&utm_content=webmail>
> <#DAB4FAD8-2DD7-40BB-A1B8-4E2AA1F9FDF2>
> 
> 2017-12-19 22:24 GMT+01:00 David Wilson <davidwwilson at comcast.net>:
> 
> > How many distinct values are taken on by a sum of n nth roots of 1?
> >
> >
> > --
> > Seqfan Mailing list - http://list.seqfan.eu/
> >
> 
> --
> Seqfan Mailing list - http://list.seqfan.eu/