|
| |
| |
|
|
|
1, 1, 6, 84, 1820, 53130, 1947792, 85900584, 4426165368, 260887834350, 17310309456440, 1276749965026536, 103619293824707388, 9176358300744339432, 880530516383349192480, 91005567811177478095440
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| Roberts states that Gupta and Khare show that a(n) > A002110(n) for 2 < n < 1794 and that a(n) < A002110(n) for n >= 1794, where A002110(n) is the product of the first n primes. - T. D. Noe, Oct 03 2007
It appears as though this sequence describes the number of ways to arrange n objects in an n x n array (e.g. stars in a flag's field pattern) [From Tom Young (mcgreg265(AT)msn.com), Jun 17 2010]
|
|
|
REFERENCES
| H. J. Brothers, Pascal's Prism: Supplementary Material, http://www.brotherstechnology.com/docs/Pascal's_Prism_(supplement).pdf.
H. Gupta and S. P. Khare, On C(k^2,k) and the product of the first k primes, Publ. Fac. Electrotechn. Belgrade, Ser. Math. Phys. 25-29 (1977) 577-598.
J. Roberts, Lure of the Integers, Math. Assoc. America, 1992, p. 265.
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=0..100
Charles R Greathouse IV, Home Page (given in lieu of email address)
|
|
|
FORMULA
| a(n) ~ 1/sqrt(2 pi) * (en)^(n - 1/2) - Charles R Greathouse IV Jul 07 2007
|
|
|
MATHEMATICA
| Table[Binomial[n^2, n], {n, 0, 22}] (*From Vladimir Joseph Stephan Orlovsky, Mar 03 2011*)
|
|
|
CROSSREFS
| Sequence in context: A113888 A163947 A128575 * A147626 A123312 A010794
Adjacent sequences: A014059 A014060 A014061 * A014063 A014064 A014065
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
