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!)
A326038 Square root of the largest square dividing the sum of divisors of n: a(n) = A000188(sigma(n)). 2
1, 1, 2, 1, 1, 2, 2, 1, 1, 3, 2, 2, 1, 2, 2, 1, 3, 1, 2, 1, 4, 6, 2, 2, 1, 1, 2, 2, 1, 6, 4, 3, 4, 3, 4, 1, 1, 2, 2, 3, 1, 4, 2, 2, 1, 6, 4, 2, 1, 1, 6, 7, 3, 2, 6, 2, 4, 3, 2, 2, 1, 4, 2, 1, 2, 12, 2, 3, 4, 12, 6, 1, 1, 1, 2, 2, 4, 2, 4, 1, 11, 3, 2, 4, 6, 2, 2, 6, 3, 3, 4, 2, 8, 12, 2, 6, 7, 3, 2, 1, 1, 6, 2, 1, 8 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
a(n) = A000188(A000203(n)) = A000196(A326039(n)).
MATHEMATICA
Table[Last[Select[Sqrt[#]&/@Divisors[DivisorSigma[1, n]], IntegerQ]], {n, 120}] (* Harvey P. Dale, Jun 25 2022 *)
PROG
(PARI)
A000188(n) = core(n, 1)[2]; \\ From A000188
A326038(n) = A000188(sigma(n));
CROSSREFS
Sequence in context: A323023 A083415 A115514 * A122632 A176809 A317815
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jun 05 2019
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 18 11:52 EDT 2024. Contains 371779 sequences. (Running on oeis4.)