Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097203
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A097203 Number of 4-tuples (a,b,c,d) with 1 <= a <= b <= c <= d, a^2+b^2+c^2+d^2 = n and gcd(a,b,c,d) = 1. +0
1
0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 2, 0, 1, 2, 0, 1, 2, 1, 1, 2, 1, 2, 0, 0, 3, 2, 1, 2, 1, 2, 0, 2, 2, 1, 3, 1, 2, 3, 0, 2, 4, 1, 2, 2, 1, 3, 0, 1, 3, 3, 2, 2, 4, 2, 0, 3, 2, 3, 3, 2, 3, 3, 0, 2, 5, 2, 3, 3, 2, 4, 0, 1, 5, 4, 2, 4, 2, 3, 0, 4, 4, 3 (list; graph; listen)
OFFSET

1,28

COMMENT

The old entry with this sequence number was a duplicate of A034836.

LINKS

N. J. A. Sloane and Vinay Vaishampayan, Table of n, a(n) for n = 1..1024

FORMULA

If a(n) > 0 then 8 does not divide n.

EXAMPLE

The solutions (if any) for n <= 20 are as follows:

n = 1:

n = 2:

n = 3:

n = 4: 1 1 1 1

n = 5:

n = 6:

n = 7: 1 1 1 2

n = 8:

n = 9:

n = 10: 1 1 2 2

n = 11:

n = 12: 1 1 1 3

n = 13: 1 2 2 2

n = 14:

n = 15: 1 1 2 3

n = 16:

n = 17:

n = 18: 1 2 2 3

n = 19: 1 1 1 4

n = 20: 1 1 3 3

CROSSREFS

Sequence in context: A025678 A073189 A025855 this_sequence A025850 A096771 A129714

Adjacent sequences: A097200 A097201 A097202 this_sequence A097204 A097205 A097206

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com) and Vinay Vaishampayan (vinay(AT)research.att.com), Oct 22 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research