The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A325653 a(n) = the product of numbers k such that sigma(k) = sigma(n). 3
1, 2, 3, 4, 5, 66, 7, 8, 9, 170, 66, 12, 13, 4830, 4830, 400, 170, 18, 19, 21320, 651, 22, 4830, 53808, 400, 21320, 27, 1092, 29, 274833900, 651, 32, 54285, 1802, 54285, 36, 37, 53808, 1092, 206480, 21320, 13835052, 43, 237380, 45, 274833900, 54285, 3600, 49 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
EXAMPLE
a(6) = 66 because sigma(6) = sigma(11) = 12; 6 * 11 = 66.
MAPLE
N:= 1000: # to get a(n) before the first n with sigma(n) > N
S:= map(numtheory:-sigma, [$1..N-1]):
m:=min(select(t -> S[t]>N, [$1..N-1]))-1:
seq(convert(select(s -> S[s]=S[n], [$1..S[n]-1]), `*`), n=1..m); # Robert Israel, Jul 04 2019
MATHEMATICA
a[n_] := Block[{s = DivisorSigma[1, n]}, Product[Which[s == DivisorSigma[1, k], k, True, 1], {k, s}]]; Array[a, 49] (* Giovanni Resta, Jul 03 2019 *)
PROG
(Magma) [&*[k: k in[1..10000] | SumOfDivisors(k) eq SumOfDivisors(n)]: n in [1..100]]
(PARI) a(n) = {my(s=sigma(n)); prod(k=1, s, if ((sigma(k)==s), k, 1)); } \\ Michel Marcus, May 12 2019
CROSSREFS
See A070242 and A325652 for number and sum of such numbers k.
Sequence in context: A062939 A069881 A004856 * A037327 A075832 A037434
KEYWORD
nonn
AUTHOR
Jaroslav Krizek, May 12 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 May 15 14:34 EDT 2024. Contains 372540 sequences. (Running on oeis4.)