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.

A122921 Express n as the sum of four squares, x^2+y^2+z^2+w^2, x>=y>=z>=w>=0, minimizing the value of x. a(n) is that x.

Original entry on oeis.org

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

Views

Author

Keywords

Examples

			10 = 2^2 + 2^2 + 1^2 + 1^2, so a(10) = 2. The only representation for 11 is 3^2 + 1^2 + 1^2 + 0^2, so a(11) = 3.
		

Crossrefs

Analogs for 3 squares: A261904 and A261915.

A122922 Express n as the sum of four squares, x^2+y^2+z^2+w^2, x>=y>=z>=w>=0, minimizing the value of x, then minimizing y for that x. a(n) is that y.

Original entry on oeis.org

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

Views

Author

Keywords

Examples

			10 = 2^2 + 2^2 + 1^2 + 1^2, so a(10) = 2. The only representation for 11 is 3^2 + 1^2 + 1^2 + 0^2, so a(11) = 1.
		

Crossrefs

A122924 Express n as the sum of four squares, x^2+y^2+z^2+w^2, x>=y>=z>=w>=0, sequentially minimizing the value of x, y and z. a(n) is that w.

Original entry on oeis.org

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

Views

Author

Keywords

Examples

			10 = 2^2 + 2^2 + 1^2 + 1^2, so a(10) = 1. The only representation for 11 is 3^2 + 1^2 + 1^2 + 0^2, so a(11) = 1.
		

Crossrefs

A178786 Express n as the sum of four squares, x^2+y^2+z^2+w^2, with x>=y>=z>=w>=0, maximizing the value of x. Then a(n) is that x.

Original entry on oeis.org

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

Views

Author

Sébastien Dumortier, Jun 24 2011

Keywords

Comments

Lagrange's theorem tells us that each positive integer can be written as a sum of four squares.

Crossrefs

Analogs for 3 squares: A261904 and A261915.

Programs

  • Python
    from math import *
    for nbre in range(0, 500): # or more than 500 !
        maxc4=0
        for c1 in range(0, int(sqrt(nbre/4))+1):
            for c2 in range(c1, int(sqrt(nbre/3))+1):
                for c3 in range(c2, int(sqrt(nbre/2))+1):
                    s3=c3**2+c2**2+c1**2
                    if s3<=nbre:
                        c4=sqrt(nbre-s3)
                        if int(c4)==c4 and c4>=c3:
                            if c4>maxc4:
                                maxc4=int(c4)
        print(maxc4, end=', ')
Showing 1-4 of 4 results.