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-5 of 5 results.

A088815 Expansion of e.g.f. (1-x)^(-1/(1+log(1-x))).

Original entry on oeis.org

1, 1, 4, 24, 190, 1860, 21638, 291158, 4443556, 75779580, 1427272032, 29409572808, 657829667328, 15868725580344, 410543007882408, 11336582934052104, 332736828827893968, 10342443317857993680, 339343476195341474688
Offset: 0

Views

Author

Vladeta Jovovic, Nov 22 2003

Keywords

Crossrefs

Row sums of A079640.

Programs

  • Mathematica
    With[{nn=20},CoefficientList[Series[(1-x)^(-1/(1+Log[1-x])), {x,0,nn}], x]Range[0,nn]!] (* Harvey P. Dale, Nov 29 2011 *)
  • PARI
    x='x+O('x^25); Vec(serlaplace((1-x)^(-1/(1+log(1-x))))) \\ G. C. Greubel, Feb 16 2017
    
  • PARI
    a_vector(n) = my(v=vector(n+1)); v[1]=1; for(i=1, n, v[i+1]=sum(j=1, i, sum(k=0, j, k!*abs(stirling(j, k, 1)))*binomial(i-1, j-1)*v[i-j+1])); v; \\ Seiichi Manyama, May 23 2022

Formula

a(n) = Sum_{k=0..n} |Stirling1(n, k)|*A000262(k). - Vladeta Jovovic, Nov 26 2003
a(n) ~ n! * exp(n + 2*sqrt(n)/sqrt(exp(1)-1) + 1/(2*(exp(1)-1)) - 1/2) / (2*sqrt(Pi) * (exp(1)-1)^(n+1/4) * n^(3/4)). - Vaclav Kotesovec, May 04 2015
a(0) = 1; a(n) = Sum_{k=1..n} A007840(k) * binomial(n-1,k-1) * a(n-k). - Seiichi Manyama, May 23 2022

A354288 Expansion of e.g.f. (1 + x)^(2/(1 - 2 * log(1+x))).

Original entry on oeis.org

1, 2, 10, 72, 664, 7440, 97712, 1468768, 24825184, 465516672, 9582002688, 214642099584, 5195322070656, 135064965744384, 3752151488840448, 110892824334154752, 3473236656134243328, 114893633354895538176, 4002000861023966189568, 146388324613230926979072
Offset: 0

Views

Author

Seiichi Manyama, May 23 2022

Keywords

Crossrefs

Programs

  • Mathematica
    With[{nn=20},CoefficientList[Series[(1+x)^(2/(1-2Log[1+x])),{x,0,nn}],x] Range[ 0,nn]!] (* Harvey P. Dale, Oct 13 2022 *)
  • PARI
    my(N=20, x='x+O('x^N)); Vec(serlaplace((1+x)^(2/(1-2*log(1+x)))))
    
  • PARI
    a_vector(n) = my(v=vector(n+1)); v[1]=1; for(i=1, n, v[i+1]=sum(j=1, i, sum(k=0, j, 2^k*k!*stirling(j, k, 1))*binomial(i-1, j-1)*v[i-j+1])); v;

Formula

a(0) = 1; a(n) = Sum_{k=1..n} A088501(k) * binomial(n-1,k-1) * a(n-k).
a(n) = Sum_{k=0..n} 2^k * A000262(k) * Stirling1(n,k).
a(n) ~ exp(-7/8 + 1/(4*(exp(1/2) - 1)) + sqrt((2*n)/(exp(1/2) - 1))*exp(1/4) - n) * n^(n - 1/4) / (2^(3/4) * (exp(1/2) - 1)^(n + 1/4)). - Vaclav Kotesovec, May 23 2022

A354289 Expansion of e.g.f. (1 + x)^(3/(1 - 3 * log(1+x))).

Original entry on oeis.org

1, 3, 24, 276, 4086, 73620, 1557702, 37770138, 1030916484, 31245154164, 1040274476208, 37716394860936, 1478413316987424, 62274364390387656, 2804282634867538248, 134397620584518275928, 6828489621874434752208, 366547074721109281366128
Offset: 0

Views

Author

Seiichi Manyama, May 23 2022

Keywords

Crossrefs

Programs

  • PARI
    my(N=20, x='x+O('x^N)); Vec(serlaplace((1+x)^(3/(1-3*log(1+x)))))
    
  • PARI
    a_vector(n) = my(v=vector(n+1)); v[1]=1; for(i=1, n, v[i+1]=sum(j=1, i, sum(k=0, j, 3^k*k!*stirling(j, k, 1))*binomial(i-1, j-1)*v[i-j+1])); v;

Formula

a(0) = 1; a(n) = Sum_{k=1..n} A335531(k) * binomial(n-1,k-1) * a(n-k).
a(n) = Sum_{k=0..n} 3^k * A000262(k) * Stirling1(n,k).
a(n) ~ exp(-11/12 + 1/(6*(exp(1/3) - 1)) + 2*exp(1/6)*sqrt(n)/sqrt(3*(exp(1/3) - 1)) - n) * n^(n - 1/4) / (sqrt(2) * 3^(1/4) * (exp(1/3) - 1)^(n + 1/4)). - Vaclav Kotesovec, May 23 2022

A088820 Numbers k with abundance radius of 8, i.e., abs(sigma(k)-2*k) = 8.

Original entry on oeis.org

22, 56, 130, 184, 368, 836, 1012, 2272, 11096, 17816, 18904, 33664, 45356, 70564, 77744, 85936, 91388, 100804, 128768, 254012, 388076, 391612, 527872, 1090912, 2087936, 2291936, 13174976, 17619844, 29465852, 35021696, 45335936, 120888092, 260378492, 381236216
Offset: 1

Views

Author

Labos Elemer, Oct 20 2003

Keywords

Comments

Original definition: Abundance-radius=8, that is Abs[sigma[n]-2n]=8 (either +8 or -8). A045770 from 3rd term complemented by -8 cases.

Examples

			22 is in the sequence since sigma(22) = 1 + 2 + 11 + 22 = 36 = 2*22 - 8.
56 is in the sequence since sigma(56) = 1 + 2 + 4 + 7 + 8 + 14 + 28 + 56 = 120 = 2*56 + 8. - _Michael B. Porter_, Jul 20 2016
		

Crossrefs

Disjoint union of A088833 (abundance 8) and A125247 (deficiency 8).
Cf. A000203 (sigma), A033880 (abundance), A005100 (deficient numbers).

Programs

  • Magma
    [n: n in [1..2*10^7] | Abs(DivisorSigma(1, n) - 2*n) eq 8]; // Vincenzo Librandi, Jul 20 2016
  • Mathematica
    Select[Range[1, 10^6], Abs[DivisorSigma[1, #] - 2 #] == 8 &] (* Vincenzo Librandi, Jul 20 2016 *)
  • PARI
    is(n)=abs(sigma(n)-2*n)==8 \\ Use, e.g., select(is,[1..10^5]*2). - M. F. Hasler, Jul 19 2016
    

Extensions

More terms from David Wasserman, Aug 18 2005
Edited by M. F. Hasler, Jul 19 2016
a(33)-a(34) from Amiram Eldar, Mar 11 2025

A256548 Triangle read by rows, T(n,k) = |n,k|*h(k), where |n,k| are the Stirling cycle numbers and h(k) = hypergeom([-k+1,-k],[],1), for n>=0 and 0<=k<=n.

Original entry on oeis.org

1, 0, 1, 0, 1, 3, 0, 2, 9, 13, 0, 6, 33, 78, 73, 0, 24, 150, 455, 730, 501, 0, 120, 822, 2925, 6205, 7515, 4051, 0, 720, 5292, 21112, 53655, 87675, 85071, 37633, 0, 5040, 39204, 170716, 494137, 981960, 1304422, 1053724, 394353
Offset: 0

Views

Author

Peter Luschny, Apr 12 2015

Keywords

Examples

			Triangle starts:
[1]
[0,   1]
[0,   1,   3]
[0,   2,   9,   13]
[0,   6,  33,   78,   73]
[0,  24, 150,  455,  730,  501]
[0, 120, 822, 2925, 6205, 7515, 4051]
		

Crossrefs

Programs

  • Sage
    A000262 = lambda n: simplify(hypergeometric([-n+1, -n], [], 1))
    A256548 = lambda n,k: A000262(k)*stirling_number1(n,k)
    for n in range(7): [A256548(n,k) for k in (0..n)]

Formula

T(n,k) = A132393(n,k)*A000262(k).
T(n,n) = A000262(n).
T(n+1,1) = n!.
Row sums are A088815.
Alternating row sums are (-1)^n*A088819(n).
Showing 1-5 of 5 results.