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!)
A290051 Least k > 1 such that the set of distinct prime divisors of k is equal to the set of distinct prime divisors of sigma_n(k) where sigma_n (k) is result of applying sum-of-divisors function n times to k. 0
6, 2, 294, 2, 126, 112, 310, 14, 150, 840, 3200, 98, 45360, 10500, 57120, 40320, 242250, 9548, 21839790, 3756480, 200425680, 678810, 1359540 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(24) > 10^9.
LINKS
EXAMPLE
a(3) = 294 because sigma(sigma(sigma(2*3*7^2))) = 2^5*3*7^2 and 2*3*7^2 = 294 is the least number with this property.
MATHEMATICA
f[n_] := Block[{k = 2}, While[ Transpose[ FactorInteger[ Nest[ DivisorSigma[1, #] &, k, n]]][[1]] != Transpose[ FactorInteger[ k]][[1]], k += 2]; k]; (* Robert G. Wilson v, Aug 03 2017 *)
CROSSREFS
Sequence in context: A192355 A100251 A266607 * A020339 A351111 A154738
KEYWORD
nonn,more
AUTHOR
Altug Alkan, Aug 03 2017
EXTENSIONS
a(10)-a(23) from Giovanni Resta, Aug 03 2017
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 March 28 17:42 EDT 2024. Contains 371254 sequences. (Running on oeis4.)