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!)
A213401 Smallest number k such that the sum of divisors of k equals n times a square > 1. 2
3, 7, 6, 22, 19, 14, 12, 21, 22, 27, 43, 33, 198, 28, 24, 66, 67, 30, 98, 57, 44, 197, 367, 42, 343, 63, 85, 91, 463, 54, 48, 93, 86, 202, 76, 66, 511, 111, 99, 120, 163, 60, 1285, 129, 88, 274, 751, 105, 364, 199, 134, 198, 211, 102, 763, 84, 147, 346, 1765 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Smallest k such that sigma(k) = n*q^2.
LINKS
EXAMPLE
a(8) = 21 because the sum of the divisors of 21 is 1 + 3 + 7 +21 = 32 = 8*4 where 4 is a square.
MAPLE
a:= proc(n) local k, p;
for k from 1 while irem(sigma(k), n, 'p')>0 or
sqrt(p)<>floor(sqrt(p)) or p=1 do od; k
end:
seq (a(n), n=1..100);
MATHEMATICA
snk[n_]:=Module[{k=2, c}, c=Sqrt[DivisorSigma[1, k]/n]; While[!IntegerQ[c] || c==1, k++; c=Sqrt[DivisorSigma[1, k]/n]]; k]; Array[snk, 60] (* Harvey P. Dale, Aug 27 2013 *)
CROSSREFS
Sequence in context: A060924 A365100 A213931 * A363146 A013564 A009467
KEYWORD
nonn
AUTHOR
Michel Lagneau, Jun 10 2012
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 19 03:05 EDT 2024. Contains 371782 sequences. (Running on oeis4.)