A284326 -id:A284326 - cp's OEIS frontend

A219601 Number of partitions of n in which no parts are multiples of 6.

1, 1, 2, 3, 5, 7, 10, 14, 20, 27, 37, 49, 65, 85, 111, 143, 184, 234, 297, 374, 470, 586, 729, 902, 1113, 1367, 1674, 2042, 2485, 3013, 3645, 4395, 5288, 6344, 7595, 9070, 10809, 12852, 15252, 18062, 21352, 25191, 29671, 34884, 40948, 47985, 56146, 65592

Offset: 0

Arkadiusz Wesolowski, Nov 23 2012

Also partitions where parts are repeated at most 5 times. [Joerg Arndt, Dec 31 2012]

			7 = 7
  = 5 + 2
  = 5 + 1 + 1
  = 4 + 3
  = 4 + 2 + 1
  = 4 + 1 + 1 + 1
  = 3 + 3 + 1
  = 3 + 2 + 2
  = 3 + 2 + 1 + 1
  = 3 + 1 + 1 + 1 + 1
  = 2 + 2 + 2 + 1
  = 2 + 2 + 1 + 1 + 1
  = 2 + 1 + 1 + 1 + 1 + 1
  = 1 + 1 + 1 + 1 + 1 + 1 + 1
so a(7) = 14.

Seiichi Manyama, Table of n, a(n) for n = 0..10000 (terms 0..1000 from Arkadiusz Wesolowski)
Vaclav Kotesovec, A method of finding the asymptotics of q-series based on the convolution of generating functions, arXiv:1509.08708 [math.CO], Sep 30 2015, p. 15.
Eric Weisstein's World of Mathematics, Partition Function b_k

Cf. A097797.
Cf. A261770, A261736, A320608.
Number of r-regular partitions for r = 2 through 12: A000009, A000726, A001935, A035959, A219601, A035985, A261775, A104502, A261776, A328545, A328546.

m = 47; f[x_] := (x^6 - 1)/(x - 1); g[x_] := Product[f[x^k], {k, 1, m}]; CoefficientList[Series[g[x], {x, 0, m}], x] (* Arkadiusz Wesolowski, Nov 27 2012 *)
Table[Count[IntegerPartitions@n, x_ /; ! MemberQ [Mod[x, 6], 0, 2] ], {n, 0, 47}] (* Robert Price, Jul 28 2020 *)

for(n=0, 47, A=x*O(x^n); print1(polcoeff(eta(x^6+A)/eta(x+A), n), ", "))

G.f.: P(x^6)/P(x), where P(x) = prod(k>=1, 1-x^k).
a(n) ~ Pi*sqrt(5) * BesselI(1, sqrt(5*(24*n + 5)/6) * Pi/6) / (3*sqrt(24*n + 5)) ~ exp(Pi*sqrt(5*n)/3) * 5^(1/4) / (12 * n^(3/4)) * (1 + (5^(3/2)*Pi/144 - 9/(8*Pi*sqrt(5))) / sqrt(n) + (125*Pi^2/41472 - 27/(128*Pi^2) - 25/128) / n). - Vaclav Kotesovec, Aug 31 2015, extended Jan 14 2017
a(n) = (1/n)*Sum_{k=1..n} A284326(k)*a(n-k), a(0) = 1. - Seiichi Manyama, Mar 25 2017

A116607 Sum of the divisors of n which are not divisible by 9.

Original entry on oeis.org

1, 3, 4, 7, 6, 12, 8, 15, 4, 18, 12, 28, 14, 24, 24, 31, 18, 12, 20, 42, 32, 36, 24, 60, 31, 42, 4, 56, 30, 72, 32, 63, 48, 54, 48, 28, 38, 60, 56, 90, 42, 96, 44, 84, 24, 72, 48, 124, 57, 93, 72, 98, 54, 12, 72, 120, 80, 90, 60, 168, 62, 96, 32, 127, 84, 144, 68, 126, 96

Offset: 1

Michael Somos, Feb 19 2006

			q + 3*q^2 + 4*q^3 + 7*q^4 + 6*q^5 + 12*q^6 + 8*q^7 + 15*q^8 + 4*q^9 + ...

B. C. Berndt, Ramanujan's Notebooks Part III, Springer-Verlag, see p. 475 Entry 7(i).

Seiichi Manyama, Table of n, a(n) for n = 1..10000
J. M. Borwein and P. B. Borwein, A cubic counterpart of Jacobi's identity and the AGM, Trans. Amer. Math. Soc., 323 (1991), no. 2, 691-701. MR1010408 (91e:33012).

A096726(n) = 3*a(n) if n>0.

Cf. A046897, A046913, A113957, A116073, A284326, A284341.

With[{c=9Range[20]},Table[Total[Complement[Divisors[i],c]],{i,80}]] (* Harvey P. Dale, Dec 19 2010 *)
Drop[CoefficientList[Series[Sum[k * x^k /(1 - x^k) - 9*k * x^(9*k) / (1 - x^(9*k)) , {k, 1, 100}], {x, 0, 100}], x], 1] (* Indranil Ghosh, Mar 25 2017 *)
f[p_, e_] := If[p == 3, 4, (p^(e + 1) - 1)/(p - 1)]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Sep 17 2020 *)

{a(n) = if( n<1, 0, sigma(n) - if( n%9==0, 9 * sigma(n/9)))}

{a(n) = polcoeff( sum( k=1, n, k * (x^k /(1 - x^k) - 9 * x^(9*k) /(1 - x^(9*k))), x * O(x^n)), n)}

q='q+O('q^66); Vec( (eta(q^3)^10/(eta(q)*eta(q^9))^3 - 1) /3 ) \\ Joerg Arndt, Mar 25 2017

from sympy import divisors
print([sum(i for i in divisors(n) if i%9) for n in range(1, 101)]) # Indranil Ghosh, Mar 25 2017

Expansion of (eta(q^3)^10 / (eta(q) eta(q^9))^3 - 1) / 3 in powers of q.
a(n) is multiplicative with a(3^e) = 4 if e>0, a(p^e) = (p^(e+1) - 1) / (p - 1) otherwise.
G.f.: Sum_{k>0} k * x^k /(1 - x^k) - 9*k * x^(9*k) / (1 - x^(9*k)).
L.g.f.: log(Product_{k>=1} (1 - x^(9*k))/(1 - x^k)) = Sum_{n>=1} a(n)*x^n/n. - Ilya Gutkovskiy, Mar 14 2018
Sum_{k=1..n} a(k) ~ (2*Pi^2/27) * n^2. - Amiram Eldar, Oct 04 2022

A284341 Sum of the divisors of n that are not divisible by 8.

Original entry on oeis.org

1, 3, 4, 7, 6, 12, 8, 7, 13, 18, 12, 28, 14, 24, 24, 7, 18, 39, 20, 42, 32, 36, 24, 28, 31, 42, 40, 56, 30, 72, 32, 7, 48, 54, 48, 91, 38, 60, 56, 42, 42, 96, 44, 84, 78, 72, 48, 28, 57, 93, 72, 98, 54, 120, 72, 56, 80, 90, 60, 168, 62, 96, 104, 7, 84, 144, 68

Offset: 1

Seiichi Manyama, Mar 25 2017

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

Cf. Sum of the divisors of n that are not divisible by k: A046913 (k=3), A046897 (k=4), A116073 (k=5), A284326 (k=6), A113957 (k=7), this sequence (k=8), A116607 (k=9), A284344 (k=10).

Table[Sum[Boole[Mod[d,8]>0] d , {d, Divisors[n]}], {n, 100}] (* Indranil Ghosh, Mar 25 2017 *)
Table[Total[DeleteCases[Divisors[n],?(Divisible[#,8]&)]],{n,120}] (* _Harvey P. Dale, Mar 18 2018 *)
f[p_, e_] := If[p == 2 && e >= 3, 7, (p^(e + 1) - 1)/(p - 1)]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Sep 17 2020 *)

for(n=1, 100, print1(sumdiv(n, d, ((d%8)>0)*d),", ")) \\ Indranil Ghosh, Mar 25 2017

from sympy import divisors
print([sum([i for i in divisors(n) if i%8]) for n in range(1, 101)]) # Indranil Ghosh, Mar 25 2017

G.f.: Sum_{k>=1} k*x^k/(1 - x^k) - 8*k*x^(8*k)/(1 - x^(8*k)). - Ilya Gutkovskiy, Mar 25 2017
Multiplicative with a(2^e) = 7 if e>=3, and a(p^e) = (p^(e + 1) - 1)/(p - 1) otherwise. - Amiram Eldar, Sep 17 2020
Sum_{k=1..n} a(k) ~ (7*Pi^2/96) * n^2. - Amiram Eldar, Oct 04 2022

Keyword:mult added by Andrew Howroyd, Jul 20 2018

A274339 The period 3 sequence of the iterated sum of deficient divisors function (A187793) starting at 15.

Original entry on oeis.org

15, 24, 18, 15, 24, 18, 15, 24, 18, 15, 24, 18, 15, 24, 18, 15, 24, 18, 15, 24, 18, 15, 24, 18, 15, 24, 18, 15, 24, 18, 15, 24, 18, 15, 24, 18, 15, 24, 18, 15, 24, 18, 15, 24, 18, 15, 24, 18, 15, 24, 18, 15, 24, 18, 15, 24, 18, 15, 24, 18

Offset: 1

Timothy L. Tiffin, Jun 22 2016

This sequence is generated in a similar way to aliquot sequences or sociable chains, which are generated by iterating the sum of proper divisors function (A001065). It appears to be the only one of period (order, length) 3 that A187793 generates under iteration.
If sigma(N) is the sum of positive divisors of N, then:
  a(n+1) = sigma(a(n)) if a(n) is a deficient number (A005100),
  a(n+1) = sigma(a(n))-a(n) if a(n) is a primitive abundant number (A071395),
  a(n+1) = sigma(a(n))-a(n)-m if a(n) is an abundant number with one proper divisor m that is either perfect (A275082) or abundant, and so forth.
This is used in the example below.
A284326 also generates this sequence under iteration. - Timothy L. Tiffin, Feb 22 2022

			a(1) = 15;
a(2) = sigma(15) = 24;
a(3) = sigma(24) - 24 - 12 - 6 = 18;
a(4) = sigma(18) - 18 - 6 = 15 = a(1).

Colin Barker, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (0,0,1).

Cf. A001065, A005100, A005101, A071395, A125310, A187793, A274338, A274340, A274380, A274549, A275082, A284326.

LinearRecurrence[{0,0,1},{15,24,18},90] (* or *) PadRight[{},90,{15,24,18}] (* Harvey P. Dale, Aug 06 2023 *)

Vec(3*x*(5 + 8*x + 6*x^2) / ((1 - x)*(1 + x + x^2)) + O(x^40)) \\ Colin Barker, Jan 30 2020

a(n+3) = a(n).

G.f.: 3*x*(5 + 8*x + 6*x^2) / ((1 - x)*(1 + x + x^2)). - Colin Barker, Jan 30 2020

A274380 The period 4 sequence of the iterated sum of deficient divisors function (A187793) starting at 34.

Original entry on oeis.org

34, 54, 42, 48, 34, 54, 42, 48, 34, 54, 42, 48, 34, 54, 42, 48, 34, 54, 42, 48, 34, 54, 42, 48, 34, 54, 42, 48, 34, 54, 42, 48, 34, 54, 42, 48, 34, 54, 42, 48, 34, 54, 42, 48, 34, 54, 42, 48, 34, 54, 42, 48, 34, 54, 42, 48, 34, 54, 42, 48

Offset: 1

Timothy L. Tiffin, Jun 22 2016

This sequence is generated in a similar way to aliquot sequences or sociable chains, which are generated by iterating the sum of proper divisors function (A001065). It appears to be one of two sequences of period (order, length) 4 that A187793 generates under iteration. The other one is A274340.
If sigma(N) is the sum of positive divisors of N, then:
  a(n+1) = sigma(a(n)) if a(n) is a deficient number (A005100),
  a(n+1) = sigma(a(n))-a(n) if a(n) is a primitive abundant number (A071395),
  a(n+1) = sigma(a(n))-a(n)-m if a(n) is an abundant number with one proper divisor m that is either perfect (A275082) or abundant, and so forth.
This is used in the example below.
A284326 also generates this sequence under iteration. - Timothy L. Tiffin, Feb 22 2022

			a(1) = 34;
a(2) = sigma(34) = 54;
a(3) = sigma(54) - 18 - 6 = 42;
a(4) = sigma(42) - 42 - 6 = 48;
a(5) = sigma(48) - 48 - 24 - 12 - 6 = 34 = a(1);
  :
  :

Colin Barker, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (0,0,0,1).

Cf. A001065, A005100, A005101, A071395, A125310, A187793, A274338, A274339, A274340, A274549, A275082, A284326.

Vec(2*x*(17 + 27*x + 21*x^2 + 24*x^3) / ((1 - x)*(1 + x)*(1 + x^2)) + O(x^80)) \\ Colin Barker, Jan 30 2020

a(n+4) = a(n).

G.f.: 2*x*(17 + 27*x + 21*x^2 + 24*x^3) / ((1 - x)*(1 + x)*(1 + x^2)). - Colin Barker, Jan 30 2020

A284344 Sum of the divisors of n that are not divisible by 10.

Original entry on oeis.org

1, 3, 4, 7, 6, 12, 8, 15, 13, 8, 12, 28, 14, 24, 24, 31, 18, 39, 20, 12, 32, 36, 24, 60, 31, 42, 40, 56, 30, 32, 32, 63, 48, 54, 48, 91, 38, 60, 56, 20, 42, 96, 44, 84, 78, 72, 48, 124, 57, 33, 72, 98, 54, 120, 72, 120, 80, 90, 60, 48, 62, 96, 104, 127, 84, 144

Offset: 1

Seiichi Manyama, Mar 25 2017

nonn

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

Cf. A261776.

Cf. Sum of the divisors of n that are not divisible by k: A046913 (k=3), A046897 (k=4), A116073 (k=5), A284326 (k=6), A113957 (k=7), A284341 (k=8), A116607 (k=9), this sequence (k=10).

Table[Sum[Boole[Mod[d, 10]>0] d , {d, Divisors[n]}], {n, 100}] (* Indranil Ghosh, Mar 25 2017 *)
Table[Total[Select[Divisors[n],Last[IntegerDigits[#]]!=0&]],{n,70}] (* Harvey P. Dale, Jun 29 2022 *)

for(n=1, 100, print1(sumdiv(n, d, ((d%10)>0)*d), ", ")) \\ Indranil Ghosh, Mar 25 2017

from sympy import divisors
print([sum([i for i in divisors(n) if i%10]) for n in range(1, 101)]) # Indranil Ghosh, Mar 25 2017

G.f.: Sum_{k>=1} k*x^k/(1 - x^k) - 10*k*x^(10*k)/(1 - x^(10*k)). - Ilya Gutkovskiy, Mar 25 2017

Sum_{k=1..n} a(k) ~ (3*Pi^2/40) * n^2. - Amiram Eldar, Oct 04 2022

A284587 Sum of the divisors of n that are not divisible by 13.

Original entry on oeis.org

1, 3, 4, 7, 6, 12, 8, 15, 13, 18, 12, 28, 1, 24, 24, 31, 18, 39, 20, 42, 32, 36, 24, 60, 31, 3, 40, 56, 30, 72, 32, 63, 48, 54, 48, 91, 38, 60, 4, 90, 42, 96, 44, 84, 78, 72, 48, 124, 57, 93, 72, 7, 54, 120, 72, 120, 80, 90, 60, 168, 62, 96, 104, 127, 6, 144, 68

Offset: 1

Seiichi Manyama, Mar 29 2017

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

Cf. A000203, A133099.

Sum of the divisors of n that are not divisible by k: A046913 (k=3), A046897 (k=4), A116073 (k=5), A284326 (k=6), A113957 (k=7), A284341 (k=8), A116607 (k=9), A284344 (k=10), this sequence (k=13), A227131 (k=25).

Table[Sum[Boole[Mod[d, 13]>0] d , {d, Divisors[n]}], {n, 100}] (* Indranil Ghosh, Mar 29 2017 *)
f[p_, e_] := If[p == 13, 1, (p^(e+1)-1)/(p-1)]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Sep 17 2020 *)

a(n)=sumdiv(n, d, ((d%13)>0)*d); \\ Andrew Howroyd, Jul 20 2018

G.f.: Sum_{k>=1} k*x^k/(1 - x^k) - 13*k*x^(13*k)/(1 - x^(13*k)). - Ilya Gutkovskiy, Mar 30 2017
Multiplicative with a(13^e) = 1 and a(p^e) = (p^(e+1)-1)/(p-1) otherwise. - Amiram Eldar, Sep 17 2020
Sum_{k=1..n} a(k) ~ (Pi^2/13) * n^2. - Amiram Eldar, Oct 04 2022

Keyword:mult added by Andrew Howroyd, Jul 20 2018

A287926 Sum of the divisors of n that are not divisible by 49.

Original entry on oeis.org

1, 3, 4, 7, 6, 12, 8, 15, 13, 18, 12, 28, 14, 24, 24, 31, 18, 39, 20, 42, 32, 36, 24, 60, 31, 42, 40, 56, 30, 72, 32, 63, 48, 54, 48, 91, 38, 60, 56, 90, 42, 96, 44, 84, 78, 72, 48, 124, 8, 93, 72, 98, 54, 120, 72, 120, 80, 90, 60, 168, 62, 96, 104, 127, 84, 144

Offset: 1

Seiichi Manyama, Jun 15 2017

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

Cf. A000203, A213598.

Sum of the divisors of n that are not divisible by k: A046913 (k=3), A046897 (k=4), A116073 (k=5), A284326 (k=6), A113957 (k=7), A284341 (k=8), A116607 (k=9), A284344 (k=10), A227131 (k=25), this sequence (k=49).

f[p_, e_] := If[p == 7, 8, (p^(e+1)-1)/(p-1)]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Sep 17 2020 *)

a(n)=sumdiv(n, d, ((d%49)>0)*d); \\ Andrew Howroyd, Jul 20 2018

Multiplicative with a(7^e) = 8 and a(p^e) = (p^(e+1)-1)/(p-1) otherwise. - Amiram Eldar, Sep 17 2020

Sum_{k=1..n} a(k) ~ (4*Pi^2/49) * n^2. - Amiram Eldar, Oct 04 2022

Keyword:mult added by Andrew Howroyd, Jul 20 2018

cp's OEIS Frontend

A219601 Number of partitions of n in which no parts are multiples of 6.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A116607 Sum of the divisors of n which are not divisible by 9.

Views

Author

Keywords

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

PARI

PARI

Python

Formula

A284341 Sum of the divisors of n that are not divisible by 8.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

Extensions

A274339 The period 3 sequence of the iterated sum of deficient divisors function (A187793) starting at 15.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A274380 The period 4 sequence of the iterated sum of deficient divisors function (A187793) starting at 34.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

A284344 Sum of the divisors of n that are not divisible by 10.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

A284587 Sum of the divisors of n that are not divisible by 13.

Views

Author

Keywords

Links

Crossrefs