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

A359240 Number of divisors of 4*n-3 of form 4*k+3.

Original entry on oeis.org

0, 0, 1, 0, 0, 2, 0, 0, 2, 0, 0, 2, 1, 0, 2, 0, 0, 2, 0, 2, 2, 0, 0, 2, 0, 0, 4, 0, 0, 2, 1, 0, 2, 2, 0, 2, 0, 0, 2, 0, 2, 4, 0, 0, 2, 0, 0, 4, 0, 0, 2, 0, 2, 2, 2, 0, 3, 0, 0, 2, 0, 2, 2, 2, 0, 2, 0, 0, 4, 0, 0, 4, 0, 0, 4, 2, 0, 2, 0, 0, 2, 0, 2, 2, 0, 2, 4, 0, 0, 4
Offset: 1

Views

Author

Seiichi Manyama, Dec 22 2022

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := DivisorSum[4*n-3, 1 &, Mod[#, 4] == 3 &]; Array[a, 100] (* Amiram Eldar, Aug 23 2023 *)
  • PARI
    a(n) = sumdiv(4*n-3, d, d%4==3);
    
  • PARI
    my(N=100, x='x+O('x^N)); concat([0, 0], Vec(sum(k=1, N, x^(3*k)/(1-x^(4*k-1)))))

Formula

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

A359239 Number of divisors of 3*n-2 of form 3*k+2.

Original entry on oeis.org

0, 1, 0, 2, 0, 2, 0, 2, 1, 2, 0, 2, 0, 4, 0, 2, 0, 2, 2, 2, 0, 3, 0, 4, 0, 2, 0, 2, 2, 4, 0, 2, 0, 4, 0, 2, 0, 4, 2, 2, 1, 2, 0, 4, 0, 4, 0, 2, 2, 2, 0, 4, 0, 6, 0, 2, 0, 2, 2, 2, 0, 4, 2, 4, 0, 3, 0, 2, 2, 4, 0, 2, 0, 6, 0, 2, 0, 4, 2, 4, 0, 2, 0, 4, 2, 4, 0, 2, 2, 2
Offset: 1

Views

Author

Seiichi Manyama, Dec 22 2022

Keywords

Crossrefs

Programs

  • Mathematica
    Table[Count[Divisors[3 n-2],?(IntegerQ[(#-2)/3]&)],{n,100}] (* _Harvey P. Dale, Apr 23 2023 *)
    a[n_] := DivisorSum[3*n-2, 1 &, Mod[#, 3] == 2 &]; Array[a, 100] (* Amiram Eldar, Aug 23 2023 *)
  • PARI
    a(n) = sumdiv(3*n-2, d, d%3==2);
    
  • PARI
    my(N=100, x='x+O('x^N)); concat(0, Vec(sum(k=1, N, x^(2*k)/(1-x^(3*k-1)))))

Formula

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

A359327 Number of divisors of 6*n-5 of form 6*k+5.

Original entry on oeis.org

0, 0, 0, 0, 1, 0, 0, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 0, 0, 2, 1, 0, 0, 0, 2, 0, 0, 0, 0, 2, 0, 2, 0, 0, 2, 0, 0, 0, 0, 2, 0, 0, 2, 0, 2, 0, 0, 0, 1, 2, 0, 0, 0, 2, 2, 0, 0, 0, 0, 2, 0, 0, 0, 0, 4, 2, 0, 0, 0, 2, 0, 0, 0, 0, 2, 2, 0, 0, 0, 2, 0, 0, 2, 0, 2, 0, 2, 0, 1, 2
Offset: 1

Views

Author

Seiichi Manyama, Dec 25 2022

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := DivisorSum[6*n-5, 1 &, Mod[#, 6] == 5 &]; Array[a, 100] (* Amiram Eldar, Aug 14 2023 *)
  • PARI
    a(n) = sumdiv(6*n-5, d, d%6==5);
    
  • PARI
    my(N=100, x='x+O('x^N)); concat([0, 0, 0, 0], Vec(sum(k=1, N, x^(5*k)/(1-x^(6*k-1)))))

Formula

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

A363858 Number of divisors of 7*n-6 of form 7*k+6.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 2, 1, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 2, 0, 2, 0, 0, 0, 2, 0, 0, 0, 0, 0, 2, 0, 0, 2, 0, 0, 2, 0, 0, 0, 1, 0, 2, 0, 0, 0, 2, 0, 2, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 2, 4, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 2, 0, 2, 0, 0
Offset: 1

Views

Author

Seiichi Manyama, Jun 24 2023

Keywords

Crossrefs

Programs

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

Formula

a(n) = A363808(7*n-6).
G.f.: Sum_{k>0} x^(6*k)/(1 - x^(7*k-1)).

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

Original entry on oeis.org

0, 0, 0, 4, 0, 0, 0, 13, 0, 0, 0, 18, 0, 0, 0, 23, 9, 0, 0, 28, 0, 0, 0, 33, 0, 23, 0, 38, 0, 0, 0, 43, 0, 0, 28, 48, 0, 0, 0, 67, 0, 0, 0, 91, 0, 0, 0, 63, 0, 0, 0, 68, 38, 33, 0, 73, 0, 0, 0, 78, 0, 43, 0, 83, 0, 0, 0, 126, 0, 0, 48, 93, 19, 0, 0, 98, 0, 0, 0, 156, 0, 43, 0, 108, 0, 0, 0, 113, 58
Offset: 1

Views

Author

Seiichi Manyama, Jul 04 2023

Keywords

Crossrefs

Programs

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

Formula

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

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

Original entry on oeis.org

0, 0, 0, 1, 0, 0, 0, 3, 0, 0, 0, 4, 0, 0, 0, 5, 2, 0, 0, 6, 0, 0, 0, 7, 0, 5, 0, 8, 0, 0, 0, 9, 0, 0, 6, 10, 0, 0, 0, 14, 0, 0, 0, 19, 0, 0, 0, 13, 0, 0, 0, 14, 8, 7, 0, 15, 0, 0, 0, 16, 0, 9, 0, 17, 0, 0, 0, 26, 0, 0, 10, 19, 4, 0, 0, 20, 0, 0, 0, 32, 0, 9, 0, 22, 0, 0, 0, 23, 12, 0, 0, 33, 0, 0, 0
Offset: 1

Views

Author

Seiichi Manyama, Jul 05 2023

Keywords

Crossrefs

Programs

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

Formula

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