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!)
A354946 a(n) = gcd(A001923(n),n^n). 1
1, 1, 1, 32, 1, 1, 1, 4, 1, 1, 1, 8, 1, 1, 9, 4, 17, 3, 19, 16, 7, 1, 1, 4, 1, 1, 1, 8, 1, 1, 1, 4, 3, 17, 1, 768, 1, 1, 1, 4, 1, 1, 1, 8, 1, 1, 1, 4, 1, 125, 3, 16, 1, 9, 1, 4, 1, 1, 1, 8, 1, 1, 1, 4, 5, 1, 1, 32, 9, 1, 1, 12, 1, 1, 5, 8, 1, 1, 1, 4, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
MATHEMATICA
A001923[n_]:=Sum[k^k, {k, 1, n}]; A[n_]:=GCD[A001923[n], n^n]; Table[A[n], {n, 1, 33}]
PROG
(PARI) a(n) = gcd(sum(k=1, n, k^k), n^n); \\ Michel Marcus, Jul 11 2022
CROSSREFS
Sequence in context: A221423 A062543 A086820 * A351000 A174923 A369651
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 12:33 EDT 2024. Contains 371969 sequences. (Running on oeis4.)