login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 4
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,9

LINKS

Table of n, a(n) for n=0..104.

EXAMPLE

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).

CROSSREFS

Cf. A064873, A064874, A064876, A064877.

Sequence in context: A025862 A004540 A089614 * A216657 A039802 A126726

Adjacent sequences:  A064872 A064873 A064874 * A064876 A064877 A064878

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Oct 10 2001

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

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

Last modified December 21 17:16 EST 2014. Contains 252324 sequences.