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!)
A061556 a(n) is the least k > 0 such that sigma(k!) >= n*k!. 2
1, 1, 3, 5, 9, 14, 23, 43, 79, 149, 263, 461, 823, 1451, 2549, 4483, 7879, 13859, 24247, 42683, 75037, 131707, 230773, 405401, 710569, 1246379, 2185021, 3831913, 6720059, 11781551, 20657677 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
It seems that, for n > 1, a(n+1) < 2*a(n). Does lim_{n -> infinity} a(n+1)/a(n) = 2? - Benoit Cloitre, Aug 18 2002
Smallest number m such that the abundancy-index of m! is at least n.
Floor(sigma(m!)/m!) = n; note that abundancy-index [= sigma(u)/u] here is not necessarily an integer.
It appears that a(n) = A091440(n) for n >= 13. - Daniel Suteu, Sep 03 2019
LINKS
Fred Helenius, Multiperfect numbers.
FORMULA
a(n) = Min{w | floor(sigma(w!)/w!) = n}.
EXAMPLE
floor(sigma(842!)/842!) = 11 while floor(sigma(843!)/843!) = 12.
PROG
(PARI) a(n)=if(n<0, 0, s=1; while(sigma(s!)<n*s!, s++); s)
CROSSREFS
Sequence in context: A120452 A144116 A294424 * A053993 A327562 A071155
KEYWORD
nonn,more
AUTHOR
Labos Elemer, May 17 2001
EXTENSIONS
More terms from David Wasserman, Jun 18 2002
a(1) inserted and a(21)-a(30) added by Daniel Suteu, Sep 03 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 25 05:18 EDT 2024. Contains 371964 sequences. (Running on oeis4.)