|
Search: id:A056038
|
|
|
| A056038 |
|
Largest factorial k! such that (k!)^2 divides n!. |
|
+0
5
|
|
| 1, 1, 1, 2, 2, 6, 6, 24, 24, 720, 720, 720, 720, 5040, 5040, 40320, 40320, 362880, 362880, 3628800, 3628800, 39916800, 39916800, 479001600, 479001600, 6227020800, 6227020800, 1307674368000, 1307674368000, 1307674368000
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
This is neither Floor[n/2]! nor Ceiling[n/2], but often coincidence with one of them.
a(n)=x!, where x=Floor[n/2]+d(n) and d=0,1,2,.. Below 1000, d=1 arises 93 times, d=2 4 times.
A105350(n) = a(n)^2.
|
|
EXAMPLE
|
n=10 or n=11: Floor[n/2]!=5!=120; 5!^2=14400 divides 10!=14400*252 or 11!=14400*2772.However, 10!/6!^2=7 and 11!/6!^2=77, i.e. (d+Floor[n/2])^2 may divide n!.Here d=1 but d>1 also occur as follows: n=416 or n=417, Floor[n/2]=208, 208!^2 divides 416! or 417!, but 209!^2 and 210!^2 also divide these factorials.
|
|
CROSSREFS
|
Cf. A000142, A001057, A001405, A055772, A056039.
Sequence in context: A129881 A132369 A081123 this_sequence A076929 A062073 A021445
Adjacent sequences: A056035 A056036 A056037 this_sequence A056039 A056040 A056041
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Jul 25 2000
|
|
|
Search completed in 0.002 seconds
|
