cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A326038 Square root of the largest square dividing the sum of divisors of n: a(n) = A000188(sigma(n)).

This page as a plain text file.
%I A326038 #12 Jun 25 2022 17:46:36
%S A326038 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,
%T A326038 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,
%U A326038 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
%N A326038 Square root of the largest square dividing the sum of divisors of n: a(n) = A000188(sigma(n)).
%H A326038 Antti Karttunen, <a href="/A326038/b326038.txt">Table of n, a(n) for n = 1..65537</a>
%H A326038 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A326038 a(n) = A000188(A000203(n)) = A000196(A326039(n)).
%t A326038 Table[Last[Select[Sqrt[#]&/@Divisors[DivisorSigma[1,n]],IntegerQ]],{n,120}] (* _Harvey P. Dale_, Jun 25 2022 *)
%o A326038 (PARI)
%o A326038 A000188(n) = core(n, 1)[2]; \\ From A000188
%o A326038 A326038(n) = A000188(sigma(n));
%Y A326038 Cf. A000188, A000196, A326038, A326039, A326040.
%K A326038 nonn
%O A326038 1,3
%A A326038 _Antti Karttunen_, Jun 05 2019