The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A056039 Largest k such that (k!)^2 divides n!. 2
 1, 1, 1, 2, 2, 3, 3, 4, 4, 6, 6, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 15, 15, 15, 15, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, 23, 23, 24, 24, 25, 25, 26, 26, 28, 28, 28, 28, 29, 29, 30, 30, 31, 31, 32, 32, 33, 33, 34, 34, 35, 35, 36, 36, 37, 37 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS a(n)=Floor[n/2]+d(n), d(n)=0,1,2,.. Below 1000, d=1 arises 93 times, d=2 4 times. A105350(n) = A001044(a(n)). LINKS CROSSREFS Cf. A000142, A001057, A001405, A055772, A056038. Sequence in context: A100881 A053263 A317908 * A181972 A058747 A034322 Adjacent sequences:  A056036 A056037 A056038 * A056040 A056041 A056042 KEYWORD nonn AUTHOR Labos Elemer, Jul 25 2000 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 20 11:26 EDT 2020. Contains 337264 sequences. (Running on oeis4.)