A064877 -id:A064877 - cp's OEIS frontend

A064874 Second of four sequences representing the lexicographical minimal decomposition of n in 4 squares: n = A064873(n)^2 + a(n)^2 + A064875(n)^2 + A064876(n)^2.

0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 2, 0, 1, 1, 0, 0, 0, 1, 0, 1, 2, 2, 2, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 3, 2, 0, 1, 1, 4, 0, 0, 1, 0, 0, 1, 1, 2, 2, 0, 1, 1, 0, 1, 1, 0, 0, 1, 3, 0, 1, 3, 3, 0, 0, 0, 1, 2, 2, 2, 2, 0, 0, 0, 1, 2, 0, 1, 1, 4, 0, 0, 1, 1, 2, 2, 2, 4, 0, 0, 1, 0, 0, 1, 1, 0

Offset: 0

Reinhard Zumkeller, Oct 10 2001

nonn

			a(19) = 1: 19 = A064873(19)^2 + a(19)^2 + A064875(19)^2 + A064876(19)^2 = 0 + 1 + 9 + 9 and the other decomposition (1, 1, 1, 4) is greater than (0, 1, 3, 3).

Cf. A064873, A064875, A064876, A064877.

A064876 Last of four sequences representing the lexicographical minimal decomposition of n in 4 squares: n = A064873(n)^2 + A064874(n)^2 + A064875(n)^2 + a(n)^2.

Original entry on oeis.org

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

Offset: 0

Reinhard Zumkeller, Oct 10 2001

nonn

			a(18) = 3: 18 = A064873(18)^2 + A064874(18)^2 + A064875(18)^2 + a(18)^2 = 0 + 0 + 9 + 9 and the other decompositions (0, 1, 1, 4) and (1, 2, 2, 3) are greater than (0, 0, 3, 3).

Cf. A064873, A064874, A064875, A064877.

A064875 Third of four sequences representing the lexicographical minimal decomposition of n in four squares: n = A064873(n)^2 + A064874(n)^2 + a(n)^2 + A064876(n)^2.

Original entry on oeis.org

0, 0, 1, 1, 0, 1, 1, 1, 2, 0, 1, 1, 2, 2, 2, 2, 0, 1, 3, 3, 2, 2, 3, 3, 2, 0, 1, 1, 1, 2, 2, 2, 4, 4, 3, 3, 0, 1, 1, 1, 2, 4, 4, 3, 2, 3, 3, 3, 4, 0, 1, 1, 4, 2, 2, 2, 4, 2, 3, 3, 3, 5, 5, 5, 0, 1, 1, 3, 2, 2, 5, 5, 6, 3, 5, 5, 6, 3, 5, 5, 4, 0, 1, 1, 4, 2, 2, 2, 6, 5, 3, 3, 3, 5, 3, 3, 4, 4, 7, 7, 0, 1, 1, 1, 2

Offset: 0

Reinhard Zumkeller, Oct 10 2001

nonn

			a(19) = 3: 19 = A064873(19)^2 + A064874(19)^2 + a(19)^2 + A064876(19)^2 = 0 + 1 + 9 + 9 and the other decomposition (1, 1, 1, 4) is greater than (0, 1, 3, 3).

Cf. A064873, A064874, A064876, A064877.

cp's OEIS Frontend

A064874 Second of four sequences representing the lexicographical minimal decomposition of n in 4 squares: n = A064873(n)^2 + a(n)^2 + A064875(n)^2 + A064876(n)^2.

Views

Author

Keywords

Examples

Crossrefs

A064876 Last of four sequences representing the lexicographical minimal decomposition of n in 4 squares: n = A064873(n)^2 + A064874(n)^2 + A064875(n)^2 + a(n)^2.

Views

Author

Keywords

Examples

Crossrefs

A064875 Third of four sequences representing the lexicographical minimal decomposition of n in four squares: n = A064873(n)^2 + A064874(n)^2 + a(n)^2 + A064876(n)^2.

Views

Author

Keywords

Examples

Crossrefs