Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A085121
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A085121 Number of ways of writing n as the sum of three odd squares. +0
3
0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 24, 0, 0, 0, 0, 0, 0, 0, 24, 0, 0, 0, 0, 0, 0, 0, 32, 0, 0, 0, 0, 0, 0, 0, 48, 0, 0, 0, 0, 0, 0, 0, 24, 0, 0, 0, 0, 0, 0, 0, 48, 0, 0, 0, 0, 0, 0, 0, 72, 0, 0, 0, 0, 0, 0, 0, 24, 0, 0, 0, 0, 0, 0, 0, 56, 0, 0, 0, 0, 0, 0, 0, 72, 0, 0, 0, 0, 0, 0, 0, 48, 0, 0, 0, 0, 0, 0, 0, 72 (list; graph; listen)
OFFSET

0,4

REFERENCES

J. E. Jones [Lennard-Jones] and A. E. Ingham, On the calculation of certain crystal potential constants and on the cubic crystal of least energy, Proc. Royal Soc., A 107 (1925), 636-653 (see p. 650).

FORMULA

G.f.: (Sum_{n=-inf..inf} q^((2n+1)^2))^3.

CROSSREFS

Cf. A005875. Equals 8*A008437. The nonzero coefficients give A005878.

Sequence in context: A128820 A067485 A127886 this_sequence A079204 A036482 A028721

Adjacent sequences: A085118 A085119 A085120 this_sequence A085122 A085123 A085124

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Apr 25 2004

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 December 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research