Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A108576
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A108576 Number of 3 X 3 magic squares (with distinct positive entries) having all entries < n. +0
4
0, 0, 0, 0, 0, 0, 0, 0, 0, 8, 16, 40, 64, 96, 128, 184, 240, 320, 400, 504, 608, 744, 880, 1056, 1232, 1440, 1648, 1904, 2160, 2464, 2768, 3120, 3472, 3880, 4288, 4760, 5232, 5760, 6288, 6888, 7488, 8160, 8832, 9576, 10320, 11144, 11968, 12880, 13792, 14784 (list; graph; listen)
OFFSET

1,10

REFERENCES

M. Beck and T. Zaslavsky, Six little squares and how their numbers grow, in preparation.

FORMULA

G.f.: (8*x^10*(2*x^2+1)) / ((1-x^6)*(1-x^4)*(1-x)^2) a(n) is given by a quasipolynomial of period 12.

EXAMPLE

a(10) = 8 because there are 8 3 X 3 magic squares with distinct entries < 10 (they are the standard magic squares).

CROSSREFS

Cf. A108577, A108578, A108579.

Sequence in context: A063526 A156331 A024700 this_sequence A108235 A052207 A038578

Adjacent sequences: A108573 A108574 A108575 this_sequence A108577 A108578 A108579

KEYWORD

nonn

AUTHOR

Thomas Zaslavsky (zaslav(AT)math.binghamton.edu), Jun 11 2005

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