
mathworld.wolfram.com/SquareNumber.html
Preview meta tags from the mathworld.wolfram.com website.
Linked Hostnames
10- 92 links tomathworld.wolfram.com
- 38 links tooeis.org
- 17 links towww.amazon.com
- 4 links towww.wolfram.com
- 4 links towww.wolframalpha.com
- 1 link toalgo.inria.fr
- 1 link towolframalpha.com
- 1 link towww.asahi-net.or.jp
Thumbnail

Search Engine Appearance
Square Number -- from Wolfram MathWorld
A square number, also called a perfect square, is a figurate number of the form S_n=n^2, where n is an integer. The square numbers for n=0, 1, ... are 0, 1, 4, 9, 16, 25, 36, 49, ... (OEIS A000290). A plot of the first few square numbers represented as a sequence of binary bits is shown above. The top portion shows S_1 to S_(255), and the bottom shows the next 510 values. The generating function giving the square numbers is (x(x+1))/((1-x)^3)=x+4x^2+9x^3+16x^4+.... (1) The (n+1)st...
Bing
Square Number -- from Wolfram MathWorld
A square number, also called a perfect square, is a figurate number of the form S_n=n^2, where n is an integer. The square numbers for n=0, 1, ... are 0, 1, 4, 9, 16, 25, 36, 49, ... (OEIS A000290). A plot of the first few square numbers represented as a sequence of binary bits is shown above. The top portion shows S_1 to S_(255), and the bottom shows the next 510 values. The generating function giving the square numbers is (x(x+1))/((1-x)^3)=x+4x^2+9x^3+16x^4+.... (1) The (n+1)st...
DuckDuckGo
Square Number -- from Wolfram MathWorld
A square number, also called a perfect square, is a figurate number of the form S_n=n^2, where n is an integer. The square numbers for n=0, 1, ... are 0, 1, 4, 9, 16, 25, 36, 49, ... (OEIS A000290). A plot of the first few square numbers represented as a sequence of binary bits is shown above. The top portion shows S_1 to S_(255), and the bottom shows the next 510 values. The generating function giving the square numbers is (x(x+1))/((1-x)^3)=x+4x^2+9x^3+16x^4+.... (1) The (n+1)st...
General Meta Tags
27- titleSquare Number -- from Wolfram MathWorld
- DC.TitleSquare Number
- DC.CreatorWeisstein, Eric W.
- DC.DescriptionA square number, also called a perfect square, is a figurate number of the form S_n=n^2, where n is an integer. The square numbers for n=0, 1, ... are 0, 1, 4, 9, 16, 25, 36, 49, ... (OEIS A000290). A plot of the first few square numbers represented as a sequence of binary bits is shown above. The top portion shows S_1 to S_(255), and the bottom shows the next 510 values. The generating function giving the square numbers is (x(x+1))/((1-x)^3)=x+4x^2+9x^3+16x^4+.... (1) The (n+1)st...
- descriptionA square number, also called a perfect square, is a figurate number of the form S_n=n^2, where n is an integer. The square numbers for n=0, 1, ... are 0, 1, 4, 9, 16, 25, 36, 49, ... (OEIS A000290). A plot of the first few square numbers represented as a sequence of binary bits is shown above. The top portion shows S_1 to S_(255), and the bottom shows the next 510 values. The generating function giving the square numbers is (x(x+1))/((1-x)^3)=x+4x^2+9x^3+16x^4+.... (1) The (n+1)st...
Open Graph Meta Tags
5- og:imagehttps://mathworld.wolfram.com/images/socialmedia/share/ogimage_SquareNumber.png
- og:urlhttps://mathworld.wolfram.com/SquareNumber.html
- og:typewebsite
- og:titleSquare Number -- from Wolfram MathWorld
- og:descriptionA square number, also called a perfect square, is a figurate number of the form S_n=n^2, where n is an integer. The square numbers for n=0, 1, ... are 0, 1, 4, 9, 16, 25, 36, 49, ... (OEIS A000290). A plot of the first few square numbers represented as a sequence of binary bits is shown above. The top portion shows S_1 to S_(255), and the bottom shows the next 510 values. The generating function giving the square numbers is (x(x+1))/((1-x)^3)=x+4x^2+9x^3+16x^4+.... (1) The (n+1)st...
Twitter Meta Tags
5- twitter:cardsummary_large_image
- twitter:site@WolframResearch
- twitter:titleSquare Number -- from Wolfram MathWorld
- twitter:descriptionA square number, also called a perfect square, is a figurate number of the form S_n=n^2, where n is an integer. The square numbers for n=0, 1, ... are 0, 1, 4, 9, 16, 25, 36, 49, ... (OEIS A000290). A plot of the first few square numbers represented as a sequence of binary bits is shown above. The top portion shows S_1 to S_(255), and the bottom shows the next 510 values. The generating function giving the square numbers is (x(x+1))/((1-x)^3)=x+4x^2+9x^3+16x^4+.... (1) The (n+1)st...
- twitter:image:srchttps://mathworld.wolfram.com/images/socialmedia/share/ogimage_SquareNumber.png
Link Tags
4- canonicalhttps://mathworld.wolfram.com/SquareNumber.html
- preload//www.wolframcdn.com/fonts/source-sans-pro/1.0/global.css
- stylesheet/css/styles.css
- stylesheet/common/js/c2c/1.0/WolframC2CGui.css.en
Links
160- http://algo.inria.fr/csolve/fermat.pdf
- http://oeis.org/A000037
- http://oeis.org/A000290
- http://oeis.org/A000415
- http://oeis.org/A000419