login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A231566 gcd(1,2n)*1^2n + ...+ gcd(i,2n)*i^2n + ... + gcd(2n,2n)*2n^2n (mod 2n). 1
1, 2, 3, 4, 5, 10, 7, 8, 9, 2, 11, 4, 13, 14, 15, 16, 17, 30, 19, 20, 27, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 12, 37, 38, 39, 72, 41, 58, 43, 44, 45, 46, 47, 80, 49, 10, 51, 52, 53, 90, 105, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
MATHEMATICA
Su[n_] := Su[n] = Mod[Sum[GCD[i, n]*PowerMod[i, n, n], {i, 1, n}], n]; Table[Su[2n], {n, 1, 44}]
CROSSREFS
Sequence in context: A252022 A039697 A319131 * A072620 A072619 A348249
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 13:42 EDT 2024. Contains 371971 sequences. (Running on oeis4.)