A001876 -id:A001876 - cp's OEIS frontend

A001879 a(n) = (2n+2)!/(n!*2^(n+1)).

1, 6, 45, 420, 4725, 62370, 945945, 16216200, 310134825, 6547290750, 151242416325, 3794809718700, 102776096548125, 2988412653476250, 92854250304440625, 3070380543400170000, 107655217802968460625, 3989575718580595893750, 155815096120119939628125

Offset: 0

N. J. A. Sloane

From Wolfdieter Lang, Oct 06 2008: (Start)
a(n) is the denominator of the n-th approximant to the continued fraction 1^2/(6+3^2/(6+5^2/(6+... for Pi-3. W. Lang, Oct 06 2008, after an e-mail from R. Rosenthal. Cf. A142970 for the corresponding numerators.
The e.g.f. g(x)=(1+x)/(1-2*x)^(5/2) satisfies (1-4*x^2)*g''(x) - 2*(8*x+3)*g'(x) -9*g(x) = 0 (from the three term recurrence given below). Also g(x)=hypergeom([2,3/2],[1],2*x). (End)
Number of descents in all fixed-point-free involutions of {1,2,...,2(n+1)}. A descent of a permutation p is a position i such that p(i) > p(i+1). Example: a(1)=6 because the fixed-point-free involutions 2143, 3412, and 4321 have 2, 1, and 3 descents, respectively. - Emeric Deutsch, Jun 05 2009
First differences of A193651. - Vladimir Reshetnikov, Apr 25 2016
a(n-2) is the number of maximal elements in the absolute order of the Coxeter group of type D_n. - Jose Bastidas, Nov 01 2021

J. Riordan, Combinatorial Identities, Wiley, 1968, p. 77 (Problem 10, values of Bessel polynomials).
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Vincenzo Librandi, Table of n, a(n) for n = 0..200
Reinis Cirpons, James East, and James D. Mitchell, Transformation representations of diagram monoids, arXiv:2411.14693 [math.RA], 2024. See pp. 3, 33.
Selden Crary, Richard Diehl Martinez and Michael Saunders, The Nu Class of Low-Degree-Truncated Rational Multifunctions. Ib. Integrals of Matern-correlation functions for all odd-half-integer class parameters, arXiv:1707.00705 [stat.ME], 2017, Table 1.
Alexander Kreinin, Integer Sequences and Laplace Continued Fraction, Preprint 2016.
J. Riordan, Notes to N. J. A. Sloane, Jul. 1968

Cf. A002544, A001814, A001876, A001877, A001878.
Second column of triangle A001497. Equals (A001147(n+1)-A001147(n))/2.
Equals row sums of A163938.

[Factorial(2*n+2)/(Factorial(n)*2^(n+1)): n in [0..20]]; // Vincenzo Librandi, Nov 22 2011

restart: G(x):=(1-x)/(1-2*x)^(1/2): f[0]:=G(x): for n from 1 to 29 do f[n]:=diff(f[n-1],x) od:x:=0:seq(f[n],n=2..20); # Zerinvary Lajos, Apr 04 2009

Table[(2n+2)!/(n!2^(n+1)),{n,0,20}] (* Vincenzo Librandi, Nov 22 2011 *)

PARI
```
a(n)=if(n<0,0,(2*n+2)!/n!/2^(n+1))
```

E.g.f.: (1+x)/(1-2*x)^(5/2).
a(n)*n = a(n-1)*(2n+1)*(n+1); a(n) = a(n-1)*(2n+4)-a(n-2)*(2n-1), if n>0. - Michael Somos, Feb 25 2004
From Wolfdieter Lang, Oct 06 2008: (Start)
a(n) = (n+1)*(2*n+1)!! with the double factorials (2*n+1)!!=A001147(n+1).
D-finite with recurrence a(n) = 6*a(n-1) + ((2*n-1)^2)*a(n-2), a(-1)=0, a(0)=1. (End)
With interpolated 0's, e.g.f.: B(A(x)) where B(x)= x exp(x) and A(x)=x^2/2.
E.g.f.: -G(0)/2 where G(k) = 1 - (2*k+3)/(1 - x/(x - (k+1)/G(k+1))); (continued fraction). - Sergei N. Gladkovskii, Dec 06 2012
G.f.: (1-x)/(2*x^2*Q(0)) - 1/(2*x^2), where Q(k) = 1 - x*(k+1)/Q(k+1); (continued fraction). - Sergei N. Gladkovskii, May 20 2013
From Karol A. Penson, Jul 12 2013: (Start)
Integral representation as n-th moment of a signed function w(x) of bounded variation on (0,infinity),
  w(x) = -(1/4)*sqrt(2)*sqrt(x)*(1-x)*exp(-x/2)/sqrt(Pi):
  a(n) = Integral_{x>=0} x^n*w(x), n>=0.
  For x>1, w(x)>0. w(0)=w(1)=limit(w(x),x=infinity)=0. For x<1, w(x)<0.
Asymptotics: a(n)->(1/576)*2^(1/2+n)*(1152*n^2+1680*n+505)*exp(-n)*(n)^(n), for n->infinity. (End)
G.f.: 2F0(3/2,2;;2x). - R. J. Mathar, Aug 08 2015

Entry revised Aug 31 2004 (thanks to Ralf Stephan and Michael Somos)

E.g.f. in comment line corrected by Wolfdieter Lang, Nov 21 2011

A001877 Number of divisors of n of the form 5k+2; a(0) = 0.

Original entry on oeis.org

0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 2, 0, 2, 0, 1, 1, 1, 0, 1, 1, 2, 0, 2, 0, 1, 1, 2, 0, 1, 0, 2, 0, 2, 1, 2, 1, 1, 0, 1, 0, 3, 0, 2, 0, 1, 1, 2, 1, 1, 1, 2, 0, 2, 0, 2, 1, 1, 0, 2, 0, 2, 1, 2, 0, 2, 1, 2, 0, 2, 0, 3, 0, 2, 0, 1, 2, 1, 0, 1, 1, 2, 0, 4, 1, 1, 1

Offset: 0

N. J. A. Sloane

T. D. Noe, Table of n, a(n) for n = 0..10000
R. A. Smith and M. V. Subbarao, The average number of divisors in an arithmetic progression, Canadian Mathematical Bulletin, Vol. 24, No. 1 (1981), pp. 37-41.

Cf. A001876, A001878, A001899.

Cf. A001620, A256780.

Join[{0}, Table[d = Divisors[n]; Length[Select[d, Mod[#, 5] == 2 &]], {n, 100}]] (* T. D. Noe, Aug 10 2012 *)
Table[Count[Divisors[n],?(Mod[#,5]==2&)],{n,0,90}] (* _Harvey P. Dale, May 20 2017 *)

a(n) = if (n==0, 0, sumdiv(n, d, (d % 5)==2)); \\ Michel Marcus, Feb 28 2021

G.f.: Sum_{n>=0} x^(5n+2)/(1-x^(5n+2)).
G.f.: Sum_{n>=1} x^(2*n)/(1-x^(5*n)). - Joerg Arndt, Jan 30 2011
Sum_{k=1..n} a(k) = n*log(n)/5 + c*n + O(n^(1/3)*log(n)), where c = gamma(2,5) - (1 - gamma)/5 = A256780 - (1 - A001620)/5 = 0.105832... (Smith and Subbarao, 1981). - Amiram Eldar, Nov 25 2023

A001878 Number of divisors of n of the form 5k+3; a(0) = 0.

Original entry on oeis.org

0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 2, 0, 0, 1, 0, 1, 2, 0, 1, 1, 1, 0, 1, 0, 1, 2, 0, 0, 2, 0, 1, 2, 1, 0, 1, 1, 0, 1, 1, 0, 3, 0, 0, 1, 1, 1, 2, 0, 2, 1, 1, 0, 1, 0, 0, 2, 1, 1, 2, 0, 1, 2, 0, 0, 3, 1, 0, 1, 1, 0, 3, 0, 1, 1, 0, 1, 2, 0, 1, 1

Offset: 0

N. J. A. Sloane

T. D. Noe, Table of n, a(n) for n = 0..10000
R. A. Smith and M. V. Subbarao, The average number of divisors in an arithmetic progression, Canadian Mathematical Bulletin, Vol. 24, No. 1 (1981), pp. 37-41.

Cf. A001876, A001877, A001899.

Cf. A001620, A256848.

Join[{0}, Table[d = Divisors[n]; Length[Select[d, Mod[#, 5] == 3 &]], {n, 100}]] (* T. D. Noe, Aug 10 2012 *)
Table[Count[Divisors[n],?(Mod[#,5]==3&)],{n,0,90}] (* _Harvey P. Dale, Nov 08 2012 *)

a(n) = if (n==0, 0, sumdiv(n, d, (d % 5)==3)); \\ Michel Marcus, Feb 28 2021

G.f.: Sum_{n>=0} x^(5*n+3)/(1 - x^(5*n+3)).
G.f.: Sum_{k>=1} x^(3*k)/(1 - x^(5*k)). - Ilya Gutkovskiy, Sep 11 2019
Sum_{k=1..n} a(k) = n*log(n)/5 + c*n + O(n^(1/3)*log(n)), where c = gamma(3,5) - (1 - gamma)/5 = A256848 - (1 - A001620)/5 = -0.0983206... (Smith and Subbarao, 1981). - Amiram Eldar, Nov 25 2023

A001899 Number of divisors of n of the form 5k+4; a(0) = 0.

Original entry on oeis.org

0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 2, 0, 0, 1, 2, 1, 0, 0, 1, 0, 1, 0, 2, 0, 1, 1, 1, 0, 1, 0, 2, 1, 0, 0, 2, 1, 0, 0, 1, 0, 2, 0, 2, 1, 1, 1, 1, 0, 0, 1, 2, 0, 0, 0, 2, 1, 1, 0, 3, 0, 1, 0, 2, 0, 1, 1, 1, 1, 0, 0, 3, 0, 0

Offset: 0

N. J. A. Sloane

T. D. Noe, Table of n, a(n) for n = 0..10000
R. A. Smith and M. V. Subbarao, The average number of divisors in an arithmetic progression, Canadian Mathematical Bulletin, Vol. 24, No. 1 (1981), pp. 37-41.

Cf. A001876, A001877, A001878.

Cf. A001620, A256849.

Join[{0}, Table[d = Divisors[n]; Length[Select[d, Mod[#, 5] == 4 &]], {n, 100}]] (* T. D. Noe, Aug 10 2012 *)

a(n) = if (n==0, 0, sumdiv(n, d, (d % 5)==4)); \\ Michel Marcus, Feb 28 2021

G.f.: Sum_{n>=0} x^(5*n+4)/(1 - x^(5*n+4)).
G.f.: Sum_{k>=1} x^(4*k)/(1 - x^(5*k)). - Ilya Gutkovskiy, Sep 11 2019
Sum_{k=1..n} a(k) = n*log(n)/5 + c*n + O(n^(1/3)*log(n)), where c = gamma(4,5) - (1 - gamma)/5 = A256849 - (1 - A001620)/5 = -0.213442... (Smith and Subbarao, 1981). - Amiram Eldar, Nov 25 2023

Better definition from Michael Somos, Aug 31 2004

A279061 Number of divisors of n of the form 7*k + 1.

Original entry on oeis.org

0, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 2, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 2, 2, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 2, 2, 1, 2, 1, 1, 1, 3, 1, 2, 1, 1, 1, 1, 2, 3, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 1, 1, 2, 2, 2, 3, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2

Offset: 0

Ilya Gutkovskiy, Dec 05 2016

Möebius transform is a period-7 sequence {1, 0, 0, 0, 0, 0, 0, ...}.

			a(8) = 2 because 8 has 4 divisors {1,2,4,8} among which 2 divisors {1,8} are of the form 7*k + 1.

Robert Israel, Table of n, a(n) for n = 0..10000
R. A. Smith and M. V. Subbarao, The average number of divisors in an arithmetic progression, Canadian Mathematical Bulletin, Vol. 24, No. 1 (1981), pp. 37-41.

Cf. A001227, A001817, A001826, A001876, A188169.

Cf. A001620, A016630, A354627 (psi(1/7)).

N:= 200: # to get a(0)..a(N)
V:= Vector(N):
for k from 1 to N do
  R:= [seq(i,i=k..N,7*k)];
  V[R]:= map(`+`,V[R],1);
od:
0,seq(V[i],i=1..N); # Robert Israel, Dec 05 2016

nmax = 120; CoefficientList[Series[Sum[x^k/(1 - x^(7 k)), {k, 1, nmax}], {x, 0, nmax}], x]
nmax = 120; CoefficientList[Series[Sum[x^(7 k + 1)/(1 - x^(7 k + 1)), {k, 0, nmax}], {x, 0, nmax}], x]
Table[Count[Divisors[n],?(IntegerQ[(#-1)/7]&)],{n,0,100}] (* _Harvey P. Dale, Nov 08 2022 *)

concat([0], Vec(sum(k=1, 100, x^k / (1 - x^(7*k))) + O(x^101))) \\ Indranil Ghosh, Mar 29 2017

G.f.: Sum_{k>=1} x^k/(1 - x^(7*k)).
G.f.: Sum_{k>=0} x^(7*k+1)/(1 - x^(7*k+1)).
Sum_{k=1..n} a(k) = n*log(n)/7 + c*n + O(n^(1/3)*log(n)), where c = gamma(1,7) - (1 - gamma)/7 = 0.713612..., gamma(1,7) = -(psi(1/7) + log(7))/7 is a generalized Euler constant, and gamma is Euler's constant (A001620) (Smith and Subbarao, 1981). - Amiram Eldar, Nov 25 2023

A279060 Number of divisors of n of the form 6*k + 1.

Original entry on oeis.org

0, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 2, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 2, 2, 2, 1, 1, 2, 2, 1, 1, 1, 1, 1, 3, 2, 1, 2, 1, 1, 2, 2, 2, 1, 1, 1, 2, 2, 2, 1, 2, 1, 2, 1, 1, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 4, 1, 2, 1, 2, 1, 2, 3, 1, 2, 1, 1, 2, 2, 2, 1, 1, 1, 2, 2, 2, 2, 1, 2, 2, 1, 2, 1, 2, 1

Offset: 0

Ilya Gutkovskiy, Dec 05 2016

Möbius transform is the period-6 sequence {1, 0, 0, 0, 0, 0, ...}.

			a(14) = 2 because 14 has 4 divisors {1,2,7,14} among which 2 divisors {1,7} are of the form 6*k + 1.

Antti Karttunen, Table of n, a(n) for n = 0..65537
R. A. Smith and M. V. Subbarao, The average number of divisors in an arithmetic progression, Canadian Mathematical Bulletin, Vol. 24, No. 1 (1981), pp. 37-41.

Cf. A001227, A001817, A001826, A001876, A035218, A140213, A188169, A319995, A320001.

Cf. A001620, A016629, A222457 (psi(1/6)).

nmax = 120; CoefficientList[Series[Sum[x^k/(1 - x^(6 k)), {k, 1, nmax}], {x, 0, nmax}], x]
nmax = 120; CoefficientList[Series[Sum[x^(6 k + 1)/(1 - x^(6 k + 1)), {k, 0, nmax}], {x, 0, nmax}], x]
Table[Count[Divisors[n],?(Mod[#,6]==1&)],{n,0,120}] (* _Harvey P. Dale, Apr 27 2018 *)

A279060(n) = if(!n,n,sumdiv(n, d, (1==(d%6)))); \\ Antti Karttunen, Jul 09 2017

from sympy import divisors
def A279060(n): return sum(d%6 == 1 for d in divisors(n)) # David Radcliffe, Jun 19 2025

G.f.: Sum_{k>=1} x^k/(1 - x^(6*k)).
G.f.: Sum_{k>=0} x^(6*k+1)/(1 - x^(6*k+1)).
From Antti Karttunen, Oct 03 2018: (Start)
a(n) = A320001(n) + [1 == n (mod 6)], where [ ] is the Iverson bracket, giving 1 only when n = 1 mod 6, and 0 otherwise.
a(n) = A035218(n) - A319995(n). (End)
a(n) = (A035218(n) + A035178(n)) / 2. - David Radcliffe, Jun 19 2025
Sum_{k=1..n} a(k) = n*log(n)/6 + c*n + O(n^(1/3)*log(n)), where c = gamma(1,6) - (1 - gamma)/6 = 0.686263..., gamma(1,6) = -(psi(1/6) + log(6))/6 is a generalized Euler constant, and gamma is Euler's constant (A001620) (Smith and Subbarao, 1981). - Amiram Eldar, Nov 25 2023

A359233 Number of divisors of 5n-1 of form 5k+1.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 3, 1, 1, 2, 2, 1, 2, 1, 2, 1, 1, 1, 4, 1, 2, 1, 2, 1, 2, 1, 2, 2, 1, 1, 3, 2, 1, 1, 3, 1, 3, 1, 2, 1, 1, 1, 4, 1, 1, 2, 2, 1, 3, 1, 3, 1, 1, 2, 4, 1, 1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 4, 1, 1, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1

Offset: 1

Seiichi Manyama, Dec 22 2022

Also number of divisors of 5*n-1 of form 5*k+4.

Seiichi Manyama, Table of n, a(n) for n = 1..10000

Cf. A078703, A099774, A359211.

Cf. A001876, A001899, A359236, A359237, A359238.

a[n_] := DivisorSum[5*n-1, 1 &, Mod[#, 5] == 1 &]; Array[a, 100] (* Amiram Eldar, Aug 23 2023 *)

PARI
```
a(n) = sumdiv(5*n-1, d, d%5==1);
```
PARI
```
a(n) = sumdiv(5*n-1, d, d%5==4);
```

my(N=100, x='x+O('x^N)); Vec(sum(k=1, N, x^k/(1-x^(5*k-1))))

my(N=100, x='x+O('x^N)); Vec(sum(k=1, N, x^(4*k-3)/(1-x^(5*k-4))))

a(n) = A001876(5*n-1) = A001899(5*n-1).
G.f.: Sum_{k>0} x^k/(1 - x^(5*k-1)).
G.f.: Sum_{k>0} x^(4*k-3)/(1 - x^(5*k-4)).

A359236 Number of divisors of 5n-2 of form 5k+1.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 2, 1, 1, 3, 1, 1, 2, 1, 1, 3, 1, 2, 2, 1, 1, 3, 1, 1, 2, 2, 1, 3, 2, 1, 2, 1, 1, 4, 1, 1, 2, 1, 1, 4, 1, 3, 2, 1, 1, 3, 1, 1, 2, 2, 2, 3, 1, 1, 3, 1, 1, 5, 1, 1, 2, 2, 1, 3, 1, 2, 2, 2, 1, 3, 1, 1, 3, 3, 1, 4, 1, 1, 2, 1, 2, 4, 1, 2, 2, 1, 1, 3, 1, 3

Offset: 1

Seiichi Manyama, Dec 22 2022

Also number of divisors of 5*n-2 of form 5*k+3.

Seiichi Manyama, Table of n, a(n) for n = 1..10000

Cf. A001876, A001878, A359233, A359237, A359238.

a[n_] := DivisorSum[5*n-2, 1 &, Mod[#, 5] == 1 &]; Array[a, 100] (* Amiram Eldar, Aug 23 2023 *)

PARI
```
a(n) = sumdiv(5*n-2, d, d%5==1);
```
PARI
```
a(n) = sumdiv(5*n-2, d, d%5==3);
```

my(N=100, x='x+O('x^N)); Vec(sum(k=1, N, x^k/(1-x^(5*k-2))))

my(N=100, x='x+O('x^N)); Vec(sum(k=1, N, x^(3*k-2)/(1-x^(5*k-4))))

a(n) = A001876(5*n-2) = A001878(5*n-2).
G.f.: Sum_{k>0} x^k/(1 - x^(5*k-2)).
G.f.: Sum_{k>0} x^(3*k-2)/(1 - x^(5*k-4)).

A359237 Number of divisors of 5n-3 of form 5k+1.

Original entry on oeis.org

1, 1, 2, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 3, 2, 2, 1, 2, 1, 3, 1, 3, 1, 2, 1, 4, 1, 2, 2, 2, 1, 3, 1, 2, 1, 3, 2, 4, 1, 2, 1, 2, 2, 3, 1, 2, 1, 3, 1, 5, 1, 2, 1, 3, 1, 3, 2, 2, 2, 2, 1, 4, 1, 3, 1, 2, 1, 3, 1, 4, 3, 2, 1, 4, 1, 2, 1, 3, 1, 3, 2, 2, 1, 2, 2, 5, 1, 3, 1

Offset: 1

Seiichi Manyama, Dec 22 2022

Also number of divisors of 5*n-3 of form 5*k+2.

Seiichi Manyama, Table of n, a(n) for n = 1..10000

Cf. A001876, A001877, A359233, A359236, A359238.

a[n_] := DivisorSum[5*n-3, 1 &, Mod[#, 5] == 1 &]; Array[a, 100] (* Amiram Eldar, Aug 23 2023 *)

PARI
```
a(n) = sumdiv(5*n-3, d, d%5==1);
```
PARI
```
a(n) = sumdiv(5*n-3, d, d%5==2);
```

my(N=100, x='x+O('x^N)); Vec(sum(k=1, N, x^k/(1-x^(5*k-3))))

my(N=100, x='x+O('x^N)); Vec(sum(k=1, N, x^(2*k-1)/(1-x^(5*k-4))))

a(n) = A001876(5*n-3) = A001877(5*n-3).
G.f.: Sum_{k>0} x^k/(1 - x^(5*k-3)).
G.f.: Sum_{k>0} x^(2*k-1)/(1 - x^(5*k-4)).

A359238 Number of divisors of 5n-4 of form 5k+1.

Original entry on oeis.org

1, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 3, 4, 2, 2, 2, 2, 2, 4, 2, 2, 2, 4, 2, 4, 2, 2, 2, 2, 2, 4, 2, 2, 4, 2, 2, 4, 2, 3, 2, 2, 2, 4, 2, 4, 2, 2, 2, 4, 2, 2, 2, 2, 2, 6, 4, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 6, 2, 2, 2, 4, 2, 4, 2, 2, 3, 2

Offset: 1

Seiichi Manyama, Dec 22 2022

Seiichi Manyama, Table of n, a(n) for n = 1..10000

Cf. A001876, A359233, A359236, A359237.

a[n_] := DivisorSum[5*n-4, 1 &, Mod[#, 5] == 1 &]; Array[a, 100] (* Amiram Eldar, Aug 23 2023 *)

PARI
```
a(n) = sumdiv(5*n-4, d, d%5==1);
```

my(N=100, x='x+O('x^N)); Vec(sum(k=1, N, x^k/(1-x^(5*k-4))))

a(n) = A001876(5*n-4).

G.f.: Sum_{k>0} x^k/(1 - x^(5*k-4)).

cp's OEIS Frontend

A001879 a(n) = (2n+2)!/(n!*2^(n+1)).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

Extensions

A001877 Number of divisors of n of the form 5k+2; a(0) = 0.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A001878 Number of divisors of n of the form 5k+3; a(0) = 0.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A001899 Number of divisors of n of the form 5k+4; a(0) = 0.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A279061 Number of divisors of n of the form 7*k + 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A279060 Number of divisors of n of the form 6*k + 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

A359233 Number of divisors of 5*n-1 of form 5*k+1.

Views

Author

Keywords

Comments

Links

Crossrefs

A359233 Number of divisors of 5n-1 of form 5k+1.

A359236 Number of divisors of 5n-2 of form 5k+1.

A359237 Number of divisors of 5n-3 of form 5k+1.

A359238 Number of divisors of 5n-4 of form 5k+1.