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.

A364092 Sum of divisors of 5*n-1 of form 5*k+1.

Original entry on oeis.org

1, 1, 1, 1, 7, 1, 1, 1, 12, 1, 7, 1, 17, 1, 1, 1, 28, 1, 1, 12, 27, 1, 7, 1, 32, 1, 1, 1, 59, 1, 12, 1, 42, 1, 7, 1, 47, 22, 1, 1, 58, 12, 1, 1, 73, 1, 33, 1, 62, 1, 1, 1, 84, 1, 1, 32, 72, 1, 28, 1, 93, 1, 1, 12, 124, 1, 1, 1, 87, 1, 7, 1, 118, 42, 12, 1, 119, 1, 1, 22, 102, 1, 53, 1, 107, 12, 32, 1
Offset: 1

Views

Author

Seiichi Manyama, Jul 04 2023

Keywords

Crossrefs

Cf. A364093, A364094, A364095.
Cf. A008438, A363514.
Cf. A284097, A359233, A364096.

Programs

  • Mathematica
    a[n_] := DivisorSum[5*n - 1, # &, Mod[#, 5] == 1 &]; Array[a, 100] (* Amiram Eldar, Jul 17 2023 *)
  • PARI
    a(n) = sumdiv(5*n-1, d, (d%5==1)*d);

Formula

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

A364094 Sum of divisors of 5*n-3 of form 5*k+1.

Original entry on oeis.org

1, 1, 7, 1, 12, 1, 17, 1, 28, 1, 27, 1, 32, 1, 43, 12, 42, 1, 47, 1, 58, 1, 73, 1, 62, 1, 84, 1, 72, 22, 77, 1, 88, 1, 87, 1, 118, 12, 119, 1, 102, 1, 107, 32, 118, 1, 117, 1, 133, 1, 190, 1, 132, 1, 153, 1, 148, 42, 147, 12, 152, 1, 189, 1, 208, 1, 167, 1, 178, 1, 204, 73, 182, 1, 224, 1, 192, 1
Offset: 1

Views

Author

Seiichi Manyama, Jul 04 2023

Keywords

Crossrefs

Cf. A364092, A364093, A364095.
Cf. A284097, A359237, A364098.

Programs

  • Mathematica
    a[n_] := DivisorSum[5*n - 3, # &, Mod[#, 5] == 1 &]; Array[a, 100] (* Amiram Eldar, Jul 17 2023 *)
  • PARI
    a(n) = sumdiv(5*n-3, d, (d%5==1)*d);

Formula

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

A364095 Sum of divisors of 5*n-4 of form 5*k+1.

Original entry on oeis.org

1, 7, 12, 17, 22, 27, 32, 43, 42, 47, 52, 57, 62, 84, 72, 77, 82, 87, 92, 119, 102, 107, 112, 117, 133, 154, 132, 137, 142, 147, 152, 189, 162, 167, 172, 204, 182, 224, 192, 197, 202, 207, 212, 259, 222, 227, 264, 237, 242, 294, 252, 273, 262, 267, 272, 329, 282, 324, 292, 297, 302, 364, 312
Offset: 1

Views

Author

Seiichi Manyama, Jul 04 2023

Keywords

Crossrefs

Cf. A364092, A364093, A364094.
Cf. A284097, A359238, A364099.

Programs

  • Mathematica
    a[n_] := DivisorSum[5*n - 4, # &, Mod[#, 5] == 1 &]; Array[a, 100] (* Amiram Eldar, Jul 12 2023 *)
  • PARI
    a(n) = sumdiv(5*n-4, d, (d%5==1)*d);

Formula

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

A364097 Expansion of Sum_{k>0} k * x^(3*k-2) / (1 - x^(5*k-4)).

Original entry on oeis.org

1, 1, 1, 3, 1, 1, 4, 1, 1, 7, 1, 1, 6, 1, 1, 9, 1, 4, 8, 1, 1, 11, 1, 1, 10, 5, 1, 13, 4, 1, 12, 1, 1, 20, 1, 1, 14, 1, 1, 20, 1, 11, 16, 1, 1, 19, 1, 1, 18, 8, 4, 21, 1, 1, 25, 1, 1, 35, 1, 1, 22, 4, 1, 25, 1, 10, 24, 7, 1, 27, 1, 1, 29, 15, 1, 34, 1, 1, 28, 1, 8, 42, 1, 4, 30, 1, 1, 33, 1, 17, 32, 1, 1
Offset: 1

Views

Author

Seiichi Manyama, Jul 04 2023

Keywords

Crossrefs

Cf. A359236, A364093.

Programs

  • Mathematica
    a[n_] := DivisorSum[5*n - 2, # + 4 &, Mod[#, 5] == 1 &]/5; Array[a, 100] (* Amiram Eldar, Jul 12 2023 *)
  • PARI
    a(n) = sumdiv(5*n-2, d, (d%5==1)*(d+4))/5;

Formula

a(n) = (1/5) * Sum_{d | 5*n-2, d==1 (mod 5)} (d+4).
G.f.: Sum_{k>0} x^k / (1 - x^(5*k-2))^2.
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.