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.

Showing 1-4 of 4 results.

A345683 a(n) = n! * Sum_{k=1..n} 1/floor(n/k).

Original entry on oeis.org

1, 3, 14, 66, 444, 2880, 25080, 216720, 2247840, 24071040, 304335360, 3752179200, 54965433600, 810550540800, 13176376012800, 219079045785600, 4078723532083200, 75227891042304000, 1550619342784512000, 31871016307113984000, 710529031487987712000, 16180987966182014976000
Offset: 1

Views

Author

Vaclav Kotesovec, Jun 23 2021

Keywords

Crossrefs

Programs

  • Mathematica
    Table[n! * Sum[1/Floor[n/k], {k, 1, n}], {n, 1, 25}]
    Table[n!*(Sum[(Floor[n/j] - Floor[n/(j + 1)])/j, {j, 1, n}]), {n, 1, 25}]
  • PARI
    a(n) = n!*sum(k=1, n, 1/(n\k)); \\ Michel Marcus, Jun 24 2021
    
  • PARI
    my(N=30, x='x+O('x^N)); Vec(serlaplace(-sum(k=1, N, (1-x^k)*log(1-x^k))/(1-x))) \\ Seiichi Manyama, Jul 23 2022
    
  • Python
    from math import factorial, isqrt
    def A345683(n): return (m:=factorial(n))*(n-1)+m//n+sum((q:=n//k)*(m//k-m//(k-1))+m//q for k in range(2,isqrt(n)+1)) # Chai Wah Wu, Oct 27 2023

Formula

a(n) ~ c * n * n!, where c = Sum_{j>=1} 1/(j^2*(j+1)) = Pi^2/6 - 1 = 0.644934... [proved by Harry Richman, see Mathoverflow link]
E.g.f.: -(1/(1-x)) * Sum_{k>0} (1 - x^k) * log(1 - x^k). - Seiichi Manyama, Jul 23 2022

A345682 a(n) = n! * Sum_{k=1..n} 1/(k*floor(n/k)).

Original entry on oeis.org

1, 2, 7, 26, 148, 804, 6228, 47424, 441936, 4288320, 50437440, 560373120, 7723935360, 106618256640, 1614841401600, 25127582054400, 446784010444800, 7727747269939200, 152873884406476800, 2966599550251008000, 62987912790921216000, 1378192085174919168000
Offset: 1

Views

Author

Vaclav Kotesovec, Jun 23 2021

Keywords

Crossrefs

Programs

  • Mathematica
    Table[n! * Sum[1/(k*Floor[n/k]), {k, 1, n}], {n, 1, 25}]
    Table[n! * Sum[(HarmonicNumber[Floor[n/j]] - HarmonicNumber[Floor[n/(1 + j)]])/j, {j, 1, n}], {n, 1, 25}]
  • PARI
    a(n) = n!*sum(k=1, n, 1/(k*(n\k))); \\ Michel Marcus, Jun 24 2021
    
  • PARI
    my(N=30, x='x+O('x^N)); Vec(serlaplace(-sum(k=1, N, (1-x^k)*log(1-x^k)/k)/(1-x))) \\ Seiichi Manyama, Jul 23 2022

Formula

a(n) ~ c * n!, where c = Sum_{j>=1} log(1 + 1/j)/j = A131688 = 1.25774...
E.g.f.: -(1/(1-x)) * Sum_{k>0} (1 - x^k) * log(1 - x^k)/k. - Seiichi Manyama, Jul 23 2022

A076000 a(n) = Product_{k=1..n} k/floor(n/k).

Original entry on oeis.org

1, 1, 2, 3, 12, 20, 120, 315, 1680, 6048, 60480, 138600, 1663200, 9266400, 69189120, 340540200, 5448643200, 22870848000, 411675264000, 2111894104320, 24135932620800, 230388447744000, 5068545850368000
Offset: 1

Views

Author

Clark Kimberling, Sep 29 2002

Keywords

Comments

Sketch of proof that a(n) is an integer from Paul R. Pudaite, 9/28/2002: 1. n! = Product{p^([n/p]+[n/p^2]+...): prime p <= n}. 2. Product{[n/k]: k = 1...n} = Product{i^([n/i]-[n/i+1]): i=2...n}. 3. = Product{Product{Product{p^([n/i]-[n/i+1]): i such that p^k|i}: k such that p^k <= n}: prime p <= n}. 4. Reorganizing the exponents in the innermost product: ([n/p^k] - [n/(p^k+1)]) + ([n/(2 p^k)] - [n/(2 p^k + 1)] + ... = [n/p^k] - ([n/(p^k+1)] - [n/(2 p^k)]) - ... <= [n/p^k].

Examples

			a(6) = 6*5*4*3*2*1/([6/1]*[6/2]*[6/3]*[6/4]*[6/5]*[6/6]) = 6!/(6*3*2*1*1*1) = 20, where [x] denotes the greatest integer <= x.
		

Crossrefs

Programs

  • Mathematica
    Table[Product[k/Floor[n/k],{k,n}],{n,30}] (* Harvey P. Dale, Feb 27 2013 *)
  • PARI
    a(n) = prod(k=1, n, k/(n\k)); \\ Michel Marcus, Jun 24 2021

Formula

a(n) = n!/A010786(n).

A342933 a(n) = n! * Sum_{k=1..n} k^2/floor(n/k).

Original entry on oeis.org

1, 9, 80, 654, 6264, 59760, 665160, 7565040, 96929280, 1286046720, 18976083840, 286363123200, 4775047200000, 81792956044800, 1515077749785600, 28898470215014400, 594066352700620800, 12467555729620992000, 280797084422959104000, 6460327992512249856000, 157769680941941612544000
Offset: 1

Views

Author

Vaclav Kotesovec, Jun 23 2021

Keywords

Comments

In general, for m>=0, Sum_{k=1..n} k^m / floor(n/k) ~ n^(m+1) * (-1 + Sum_{j=2..m+2} zeta(j) / (m+1)).

Crossrefs

Programs

  • Mathematica
    Table[n!*Sum[k^2/Floor[n/k], {k, 1, n}], {n, 1, 25}]
    Table[n!*Sum[(Floor[n/j]*(1 + Floor[n/j])*(1 + 2*Floor[n/j]) - Floor[n/(1 + j)]*(1 + Floor[n/(1 + j)])*(1 + 2*Floor[n/(1 + j)]))/6/j, {j, 1, n}], {n, 1, 25}]

Formula

a(n) ~ c * n^3 * n!, where c = Sum_{j>=1} (1 + 3*j*(j+1)) / (3*j^4*(j+1)^3) = (zeta(4) + zeta(3) + zeta(2))/3 - 1 = Pi^2/18 + Pi^4/270 + zeta(3)/3 - 1.
Showing 1-4 of 4 results.