cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A195504 Product of numbers up to n-1 used as divisors in A008336(n), n >= 2; a(1) = 1.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 6, 6, 6, 6, 60, 60, 720, 720, 10080, 10080, 10080, 10080, 181440, 181440, 3628800, 3628800, 79833600, 79833600, 79833600, 79833600, 2075673600, 2075673600, 58118860800, 58118860800, 1743565824000, 1743565824000, 1743565824000, 1743565824000
Offset: 1

Views

Author

Daniel Forgues, Sep 19 2011

Keywords

Comments

This sequence provides more insight into the asymptotic behavior of log(A008336(n)). - Daniel Forgues, Sep 21 2011

Crossrefs

Programs

  • Maple
    A008336 := proc(n) option remember; if(n=1)then 1: elif(procname(n-1) mod (n-1)=0)then procname(n-1)/(n-1): else procname(n-1)*(n-1): fi: end: A195504 := proc(n) option remember: if(n=1)then 1: elif(A008336(n)<A008336(n-1))then (n-1)*procname(n-1): else procname(n-1): fi: end: seq(A195504(n),n=1..40); # Nathaniel Johnston, Sep 29 2011

Formula

Sqrt((n-1)! / A008336(n)), n >= 1.