login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A339471
a(n) = floor(sqrt(Re(s)^2 + Im(s)^2)) where s = Sum_k={1..n} e^(2*n*Pi*i/k).
0
0, 1, 2, 1, 2, 0, 3, 1, 2, 2, 2, 0, 5, 3, 1, 2, 5, 2, 3, 2, 5, 5, 4, 0, 6, 6, 4, 3, 4, 3, 7, 6, 5, 4, 4, 4, 9, 9, 4, 3, 7, 6, 8, 7, 7, 7, 6, 3, 9, 10, 9, 8, 8, 4, 8, 9, 11, 11, 9, 5, 10, 10, 8, 8, 12, 11, 12, 10, 7, 8, 10, 10, 15, 14, 11, 10, 11, 9, 11, 11
OFFSET
0,3
COMMENTS
Inspired by the n roots of unity which are e^(2*Pi*i/n), e^(4*Pi*i/n), e^(6*Pi*i/n), ..., e^(2*k*Pi*i/n), ..., e^(2*Pi*i), where 1 <= k <= n.
If b(n) = floor(sqrt(Re(t)^2 + Im(t)^2)), where t = Sum_{k=1..n} E^(2k*Pi*i/n), then the sequence is 0,1,0,0,0, ..., = A063524.
For this sequence I inverted n and k in the formula for the n roots of unity.
First occurrence of k: 0, 1, 2, 6, 22, 12, 24, 30, 42, 36, 49, 56, 64, -1, 73, ...
Last occurrence of k: 24, 15, 20, 48, 54, 60, 47, 69, 70, 96, 88, 89, 108, -1, ...
The number of times k occurs: 4, 4, 8, 7, 8, 6, 5, 6, 7, 8, 9, 8, 6, 0, 11, 9, ...
Numbers that do not occur: 13, 96, 150, 231, 1149, 1410, ...
LINKS
Eric Weisstein's World of Mathematics, Root of Unity.
FORMULA
a(n) = floor(sqrt(Re(s)^2 + Im(s)^2)), where s = Sum_{k=1..n} e^(2*n*Pi*i/k).
MATHEMATICA
f[n_] := Block[{s = Sum[Exp[2n* Pi*I/k], {k, n}]}, Floor[ Sqrt[ N[ Re[s]^2] + N[ Im[s]^2]]]]; Array[f, 75, 0]
CROSSREFS
Sequence in context: A102587 A272608 A257460 * A159834 A274576 A257081
KEYWORD
nonn
AUTHOR
Robert G. Wilson v, Dec 02 2020
STATUS
approved