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.

A319853 Number of ways to write n as the sum of 4 positive integers a,b,c,d such that a/b - c/d = (a - c)/(b + d).

Original entry on oeis.org

0, 0, 0, 1, 0, 2, 0, 5, 0, 4, 2, 5, 2, 10, 0, 9, 2, 14, 2, 11, 2, 16, 6, 15, 2, 18, 4, 21, 4, 18, 6, 27, 6, 24, 4, 27, 6, 32, 8, 25, 8, 32, 10, 39, 4, 36, 8, 35, 10, 42, 10, 37, 12, 42, 6, 45, 14, 52, 14, 41, 12, 52, 10, 55, 12, 54, 14, 57, 12, 52, 20, 59, 14, 68
Offset: 1

Views

Author

Hugo Pfoertner and Rainer Rosenthal, Sep 29 2018

Keywords

Examples

			a(4) = 1: 1/1 - 1/1 = (1 - 1)/(1 + 1);
a(6) = 2: 1/2 - 1/2 = (1 - 1)/(2 + 2), 2/1 - 2/1 = (2 - 2)/(1 + 1);
a(8) = 5: 1/1 - 4/2 = (1 - 4)/(1 + 2), 1/3 - 1/3 = (1 - 1)/(3 + 3),
          2/2 - 2/2 = (2 - 2)/(2 + 2), 3/1 - 3/1 = (3 - 3)/(1 + 1),
          4/2 - 1/1 = (4 - 1)/(2 + 1).
		

Crossrefs

Programs

  • PARI
    m=74;v=vector(m);for(a=1,m,for(b=1,m,for(c=1,m,for(d=1,m,n=a+b+c+d;if(n<=m,if((a/b-c/d)==((a-c)/(b+d)),v[n]++))))));v

A320312 Number of ways to write n as the sum of 4 positive integers a, b, c, d such that b != d and a/b - c/d = (a - c)/(b - d).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 2, 1, 2, 1, 0, 5, 1, 3, 1, 3, 3, 2, 2, 3, 4, 4, 3, 5, 1, 4, 4, 8, 3, 6, 4, 4, 4, 6, 6, 7, 5, 8, 5, 6, 4, 11, 4, 11, 6, 7, 6, 13, 8, 7, 8, 13, 4, 11, 5, 12, 10, 11, 9, 11, 9, 10, 10, 12, 7, 18, 6, 15, 10, 15
Offset: 1

Views

Author

Hugo Pfoertner, Oct 10 2018

Keywords

Crossrefs

Programs

  • PARI
    m=80;v=vector(m);for(a=1,m,for(b=1,m,for(c=1,m,for(d=1,m,n=a+b+c+d;if(n<=m,if(b!=d&&a/b-c/d==(a-c)/(b-d),v[n]++))))));v

A320313 Number of ways to write n as the sum of 4 positive integers a, b, c, d such that d < b and a/b - c/d = (a - c)/(b - d).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 2, 0, 2, 0, 1, 1, 0, 1, 1, 2, 1, 1, 2, 0, 2, 1, 3, 1, 2, 2, 1, 1, 2, 3, 2, 2, 3, 2, 2, 1, 4, 1, 4, 2, 2, 3, 5, 3, 3, 2, 5, 1, 4, 2, 4, 5, 4, 3, 3, 4, 4, 3, 3, 3, 6, 2, 5, 4, 7, 3, 9, 3, 4, 3, 5
Offset: 1

Views

Author

Hugo Pfoertner, Oct 10 2018

Keywords

Crossrefs

Programs

  • PARI
    m=86;v=vector(m);for(a=1,m,for(b=1,m,for(c=1,m,for(d=1,b-1,n=a+b+c+d;if(n<=m,if(a/b-c/d==(a-c)/(b-d),v[n]++))))));v

A320311 Number of ways to write n as the sum of 4 positive integers a, b, c, d such that 1 - a/c = (1 - b/d)^2.

Original entry on oeis.org

0, 0, 0, 1, 0, 2, 0, 3, 0, 5, 0, 6, 1, 6, 0, 8, 2, 9, 2, 10, 0, 15, 1, 14, 1, 15, 3, 15, 2, 17, 4, 19, 3, 21, 1, 21, 4, 26, 3, 25, 4, 24, 4, 27, 6, 29, 5, 31, 5, 30, 4, 36, 4, 37, 6, 34, 6, 41, 8, 36, 8, 43, 4, 42, 5, 44, 10, 44, 9, 45, 9, 45, 10, 48
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • PARI
    m=74;v=vector(m);for(a=1,m,for(b=1,m,for(c=1,m,for(d=1,m,n=a+b+c+d;if(n<=m,if(1-a/c==(1-b/d)^2,v[n]++))))));v
Showing 1-4 of 4 results.