700 (seven hundred) is the natural number following 699 and preceding 701.
| ||||
|---|---|---|---|---|
| Cardinal | seven hundred | |||
| Ordinal | 700th (seven hundredth) | |||
| Factorization | 22 × 52 × 7 | |||
| Greek numeral | Ψ´ | |||
| Roman numeral | DCC, dcc | |||
| Binary | 10101111002 | |||
| Ternary | 2212213 | |||
| Senary | 31246 | |||
| Octal | 12748 | |||
| Duodecimal | 4A412 | |||
| Hexadecimal | 2BC16 | |||
| Armenian | Չ | |||
| Hebrew | ת"ש / ן | |||
| Babylonian cuneiform | 𒌋𒐕𒐏 | |||
| Egyptian hieroglyph | 𓍨 | |||
It is a composite number and the sum of four consecutive primes (167 + 173 + 179 + 181).
Integers from 701 to 799
editNearly all of the palindromic integers between 700 and 800 (i.e. nearly all numbers in this range that have both the hundreds and units digit be 7) are used as model numbers for Boeing Commercial Airplanes.
700s
edit701
edit701 is:
- a prime number
- the sum of three consecutive primes (229 + 233 + 239)
- a Chen prime
- an Eisenstein prime with no imaginary part
702
edit702 = 2 × 33 × 13. It is:
- a pronic number[1]
- a nontotient
- a Harshad number
703
edit703 = 19 × 37. It is:
- the 37th triangular number[2]
- a hexagonal number[3]
- the smallest number requiring 73 fifth powers for Waring representation
- a Kaprekar number[4]
Other fields:
- a number commonly found in the formula for body mass index
704
edit704 = 26 × 11. It is:
- a Harshad number
- a lazy caterer number (sequence A000124 in the OEIS)
705
edit705 = 3 × 5 × 47. It is:
- a sphenic number
- the smallest Bruckman-Lucas pseudoprime (sequence A005845 in the OEIS)
706
edit706 = 2 × 353. It is:
- a nontotient
- a Smith number[5]
707
edit707 = 7 × 101. It is:
- the sum of five consecutive primes (131 + 137 + 139 + 149 + 151)
- a palindromic number
- the number of lattice paths from (0,0) to (5,5) with steps (0,1), (1,0) and, when on the diagonal, (1,1).[6]
708
edit708 = 22 × 3 × 59. It is the number of partitions of 28 that do not contain 1 as a part.[7]
709
edit709 is:
- a prime number
- a happy number
It is the seventh in the series 2, 3, 5, 11, 31, 127, 709 where each number is the nth prime with n being the number preceding it in the series, therefore, it is a prime index number.
710s
edit710
edit711
edit711 = 32 × 79. It is:
- a Harshad number
- the number of planar Berge perfect graphs on 7 nodes[10]
It is also the phone number of Telecommunications Relay Service, commonly used by the deaf and hard-of-hearing.
712
edit712 = 23 × 89. It is:
- a refactorable number
- the sum of the first twenty-one primes
- the totient sum for first 48 integers.
It is the largest known number such that it and its 8th power (66,045,000,696,445,844,586,496) have no common digits.
713
edit713 = 23 × 31. It is a Blum integer.
714
edit714 = 2 × 3 × 7 × 17. It is:
- a nontotient
- a balanced number[11]
- a member of a Ruth–Aaron pair (either definition)
- the sum of twelve consecutive primes (37 + 41 + 43 + 47 + 53 + 59 + 61 + 67 + 71 + 73 + 79 + 83)
The product of 714 and 715 is the product of the first 7 prime numbers (2, 3, 5, 7, 11, 13, and 17).
Other fields:
- It s an area code for Orange County, California.
- Flight 714 to Sidney is a Tintin graphic novel.
- 714 is the badge number of Sergeant Joe Friday.
715
edit715 = 5 × 11 × 13. It is:
- a sphenic number
- a pentagonal number[12]
- a Harshad number
- a member of Ruth-Aaron pair (either definition)
It is a pentatope number because 713=.[13]
716
edit716 = 22 × 179.
717
edit717 = 3 × 239. It is a palindromic number.
718
edit718 = 2 × 359.
719
edit719 is:
- a prime number
- a factorial prime (6! − 1)[14]
- a Sophie Germain prime[15]
- a safe prime[16]
- a Chen prime
- an Eisenstein prime with no imaginary part
- the sum of seven consecutive primes (89 + 97 + 101 + 103 + 107 + 109 + 113)
720s
edit720
edit721
edit721 = 7 × 103. It is:
- a centered hexagonal number[17]
- the sum of nine consecutive primes (61 + 67 + 71 + 73 + 79 + 83 + 89 + 97 + 101)
- the smallest number that is the difference of two positive cubes in two ways
722
edit723
edit723 = 3 × 241. It is the side length of an almost-equilateral Heronian triangle.[20]
724
edit724 = 22 × 181. It is:
- a nontotient
- the sum of four consecutive primes (173 + 179 + 181 + 191)
- the sum of six consecutive primes (107 + 109 + 113 + 127 + 131 + 137)
- the side length of an almost-equilateral Heronian triangle[21]
- the number of n-queens problem solutions for n = 10
725
edit725 = 52 × 29. It is the side length of an almost-equilateral Heronian triangle.[22]
726
edit726 = 2 × 3 × 112.It is a pentagonal pyramidal number.[23]
727
edit727 is:
- a prime number
- a palindromic prime
- a lucky prime[24]
728
edit728 = 23 × 7 × 13. It is:
- a nontotient
- a Smith number[5]
- a cabtaxi number[25]
- the number of cubes of edge length 1 required to make a hollow cube of edge length 12
- the number of connected graphs on 5 labelled vertices
Also:
- 728!! - 1 is prime.[26]
- 72864 + 1 is prime.
729
edit729 = 272 = 93 = 36.
- the square of 27, and the cube of 9, the sixth power of three, and because of these properties, a perfect totient number[27]
- the largest three-digit cube (9 x 9 x 9)
- the only three-digit sixth power (3 x 3 x 3 x 3 x 3 x 3)
- a centered octagonal number[28]
- a Smith number[5]
A philosopher king's pleasure is 729 times a tyrant's pleasure according to Plato in the Republic.
730s
edit730
edit730 = 2 × 5 × 73. It is:
- a sphenic number
- a nontotient
- a Harshad number
- the number of generalized weak orders on 5 points [29]
731
edit731 = 17 × 43. It is:
- the sum of three consecutive primes (239 + 241 + 251)
- the number of Euler trees with total weight 7 [30]
732
edit732 = 22 × 3 × 61. It is:
- a Harshad number
- the number of collections of subsets of {1, 2, 3, 4} that are closed under union and intersection[31]
- the sum of eight consecutive primes (73 + 79 + 83 + 89 + 97 + 101 + 103 + 107)
- the sum of ten consecutive primes (53 + 59 + 61 + 67 + 71 + 73 + 79 + 83 + 89 + 97)
733
edit733 is:
- a prime number
- a balanced prime[32]
- a permutable prime, and thus an emirp
- the sum of five consecutive primes (137 + 139 + 149 + 151 + 157)
734
edit734 = 2 × 367. It is:
- a nontotient
- the number of traceable graphs on 7 nodes[33]
735
edit735 = 3 × 5 × 72.It is:
- a Harshad number
- a Zuckerman number
- the smallest number such that uses the same digits as its distinct prime factors
736
edit736 = 25 × 23. It is:
- a centered heptagonal number[34]
- a happy number
- a Harshad number
- a nice Friedman number since 736 = 7 + 36
737
edit737 = 11 × 67. It is:
738
edit738 = 2 × 32 × 41. It is a Harshad number.
739
edit739 is:
- a prime number
- a lucky prime [24]
- a prime index prime
- a happy number
- a strictly non-palindromic number[35]
740s
edit740
edit740 = 22 × 5 × 37. It is:
- a nontotient
- the number of connected square free graphs on 9 nodes [36]
741
edit741 = 3 × 13 × 19. It is:
- a sphenic number
- the 38th triangular number[2]
742
edit742 = 2 × 7 × 53. It is:
- a sphenic number
- a decagonal number[37]
- an icosahedral number.
- a lazy caterer number (sequence A000124 in the OEIS)
- the number of partitions of 30 into divisors of 30.[38]
- the smallest number that is one more than triple its reverse.
743
edit744
edit745
edit745 = 5 × 149. There are 745 non-connected simple labeled graphs covering 6 vertices.[39]
746
edit746 = 2 × 373.
It is a nontotient. There are 746 non-normal semi-magic squares with sum of entries equal to 6.[40]
746=15 + 24 + 36 = 17 + 24 + 36.
747
edit747 = 32 × 83. It is a palindromic number.
747=[41]
748
edit748 = 22 × 11 × 17. It is:
- a nontotient
- a happy number
- a primitive abundant number[42]
749
edit749 = 7 × 107. It is:
- a blum integer
- the sum of three consecutive primes (241 + 251 + 257)
750s
edit750
edit750 = 2 × 3 × 53. It is an enneagonal number.[43]
751
edit751 is:
- a prime number
- a Chen prime
- an emirp
752
edit752 = 24 × 47. It is a nontotient. There are 752 partitions of 11 into parts of 2 kinds[44]
753
edit753 = 3 × 251. It is a blum integer.
754
edit754 = 2 × 13 × 29. It is:
- a sphenic number
- a nontotient
- the totient sum for first 49 integers
There are 754 different ways to divide a 10 × 10 square into sub-squares.[45]
755
edit755 = 5 × 151. There are 755 vertices in a regular drawing of the complete bipartite graph K9,9.[46]
756
edit756 = 22 × 33 × 7. It is:
- a pronic number[1]
- a Harshad number
- the sum of six consecutive primes (109 + 113 + 127 + 131 + 137 + 139)
757
edit757 is:
- a prime number
- a palindromic prime
- a happy number
- the sum of seven consecutive primes (97 + 101 + 103 + 107 + 109 + 113 + 127)
"The 757" is a local nickname for the Hampton Roads area in the U.S. state of Virginia, derived from the telephone area code that covers almost all of the metropolitan area.
758
edit758 = 2 × 379. It is:
- a nontotient
- a prime number of measurement [47]
759
edit759 = 3 × 11 × 23. It is:
- a sphenic number
- the sum of five consecutive primes (139 + 149 + 151 + 157 + 163)
- a q-Fibonacci number for q=3 [48]
760s
edit760
edit760 = 23 × 5 × 19.
It is a centered triangular number.[49] There are 760 fixed heptominoes.
761
edit761 is:
- a prime number,
- an emirp,
- a Sophie Germain prime,[15]
- a Chen prime,
- an Eisenstein prime with no imaginary part
- a centered square number[50]
762
edit762 = 2 × 3 × 127. It is:
- a sphenic number
- a nontotient
- a Smith number[5]
- an admirable number
- the sum of four consecutive primes (181 + 191 + 193 + 197)
There are 762 1's in all partitions of 25 into odd parts[51] There are Six nines in the decimal representation of pi after the 762nd digit.
763
edit763 = 7 × 109.
It is the sum of nine consecutive primes (67 + 71 + 73 + 79 + 83 + 89 + 97 + 101 + 103). There are 763 degree-8 permutations of order exactly 2.[52]
764
edit764 = 22 × 191. It is a telephone number.[53]
765
edit766
edit766 = 2 × 383. It is:
- a centered pentagonal number[55]
- a nontotient
- the sum of twelve consecutive primes (41 + 43 + 47 + 53 + 59 + 61 + 67 + 71 + 73 + 79 + 83 + 89)
767
edit767 = 13 × 59. It is
- a Thabit number (28 × 3 − 1)
- a palindromic number
768
edit768 = 28 × 3.[56] It is the sum of eight consecutive primes (79 + 83 + 89 + 97 + 101 + 103 + 107 + 109).
769
edit769 is:
- a prime number
- a Chen prime
- a lucky prime[24]
- a Proth prime[57]
770s
edit770
edit770 = 2 × 5 × 7 × 11. It is:
- a nontotient
- a Harshad number
is prime[58]
Other fields:
It holds special importance in the Chabad-Lubavitch Hasidic movement.
771
edit771 = 3 × 257.
It is sum of three consecutive primes in arithmetic progression (251 + 257 + 263). Since 771 is the product of the distinct Fermat primes 3 and 257, a regular polygon with 771 sides can be constructed using compass and straightedge, and can be written in terms of square roots.
772
edit772 = 22 × 193.
772!!!!!!+1 is prime.[59]
773
edit773 is:
- a prime number
- an Eisenstein prime with no imaginary part
- a prime index prime
- a tetranacci number[60]
- the sum of the number of cells that make up the convex, regular 4-polytopes
774
edit774 = 2 × 32 × 43. It is:
- a nontotient
- the totient sum for first 50 integers
- a Harshad number
775
edit775 = 52 × 31. It is a member of the Mian–Chowla sequence[61]
776
edit776 = 23 × 97.
It is a refactorable number. There are 776 compositions of 6 whose parts equal to q can be of q2 kinds.[62]
777
edit778
edit778 = 2 × 389. It is:
- a nontotient
- a Smith number[5]
779
edit779 = 19 × 41. It is a highly cototient number.[63]
780s
edit780
edit780 = 22 × 3 × 5 × 13. It is
- a hexagonal number[3]
- a Harshad number
- the 39th triangular number[2]
- the sum of four consecutive primes in a quadruplet (191, 193, 197, and 199)
- the sum of ten consecutive primes (59 + 61 + 67 + 71 + 73 + 79 + 83 + 89 + 97 + 101),
780 and 990 are the fourth smallest pair of triangular numbers whose sum and difference (1770 and 210) are also triangular.
781
edit781 = 11 × 71. It is:
- a zero of the Mertens function
- a lazy caterer number (sequence A000124 in the OEIS)
- the sum of powers of 5/repdigit in base 5 (11111)
782
edit782 = 2 × 17 × 23. It is
- a sphenic number
- a nontotient
- a pentagonal number[12]
- a Harshad number
783
edit783 = 33 × 29. It is a heptagonal number.
784
edit784 = 24 × 72. It is a happy number.
Since 784=282, 784 is a perfect square. It is the sum of the cubes of the first seven positive integers; .
785
edit785 = 5 × 157. It is a zero of the Mertens function. There are 785 series-reduced planted trees with 6 leaves of 2 colors.[64]
786
edit787
edit787 is:
- a prime number
- a Chen prime
- a lucky prime[24]
- a palindromic prime
- the sum of five consecutive primes (149 + 151 + 157 + 163 + 167)
788
edit788 = 22 × 197.
It is a nontotient. There are 788 compositions of 12 into parts with distinct multiplicities.[65]
789
edit789 = 3 × 263. It is:
- a Blum integer
- the sum of three consecutive primes (257 + 263 + 269)
790s
edit790
edit790 = 2 × 5 × 79. It is:
- a sphenic number
- a nontotient
- an aspiring number[66]
- the aliquot sum of 1574
- a Harshad number in bases 2, 7, 14 and 16
791
edit791 = 7 × 113. It is:
- a centered tetrahedral number
- the sum of the first twenty-two primes
- the sum of seven consecutive primes (101 + 103 + 107 + 109 + 113 + 127 + 131)
792
edit792 = 23 × 32 × 11. It is:
- a Harshad number
- the sum of the nontriangular numbers between successive triangular numbers
There are 792 integer partitions of 21.[67]
792=, a binomial coefficent.
793
edit793 = 13 × 61. It is:
- a zero of the Mertens function
- a star number[68]
- a happy number
794
edit794 = 2 × 397. [69] It is a nontotient.
794= 16 + 26 + 36.
795
edit795 = 3 × 5 × 53. It is:
- a sphenic number
- a zero of the Mertens function
There are 795 permutations of length 7 with 2 consecutive ascending pairs.[70]
796
edit796 = 22 × 199. It is:
- a zero of the Mertens function
- the sum of six consecutive primes (113 + 127 + 131 + 137 + 139 + 149)
797
edit- 797 is:
- a prime number
- a Chen prime
- an Eisenstein prime with no imaginary part
- a palindromic prime
- a two-sided prime
- a prime index prime.
798
edit- 798 = 2 × 3 × 7 × 19. It is:
- a zero of the Mertens function
- a nontotient
- the product of primes indexed by the prime exponents of 10! [71]
799
edit799 = 17 × 47. It is the smallest number with digit sum 25 [72]
References
edit- 1 2 "Sloane's A002378 : Oblong (or promic, pronic, or heteromecic) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- 1 2 3 "Sloane's A000217 : Triangular numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- 1 2 "Sloane's A000384 : Hexagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- ↑ "Sloane's A006886 : Kaprekar numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- 1 2 3 4 5 "Sloane's A006753 : Smith numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- ↑ Sloane, N. J. A. (ed.). "Sequence A026671 (Number of lattice paths from (0,0) to (n,n) with steps (0,1), (1,0) and, when on the diagonal, (1,1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 22 May 2022.
- ↑ Sloane, N. J. A. (ed.). "Sequence A002865 (Number of partitions of n that do not contain 1 as a part)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2 June 2022.
- ↑ Hougardy, Stefan (October 2006). "Classes of perfect graphs". Discrete Mathematics. 306 (19–20): 2529–2571. doi:10.1016/j.disc.2006.05.021.
- ↑ Sloane, N. J. A. (ed.). "Sequence A005195 (Number of forests with n unlabeled nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 22 May 2022.
- ↑ Sloane, N. J. A. (ed.). "Sequence A123449 (Number of planar Berge perfect graphs on n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A020492 (Balanced numbers: numbers k such that phi(k) (A000010) divides sigma(k) (A000203))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- 1 2 "Sloane's A000326 : Pentagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- ↑ "Sloane's A000332 : Binomial coefficient binomial(n,4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- ↑ "Sloane's A088054 : Factorial primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- 1 2 "Sloane's A005384 : Sophie Germain primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- ↑ "Sloane's A005385 : Safe primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- ↑ "Sloane's A003215 : Hex (or centered hexagonal) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- ↑ Sloane, N. J. A. (ed.). "Sequence A066897 (Total number of odd parts in all partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 22 May 2022.
- ↑ Sloane, N. J. A. (ed.). "Sequence A001105 (a(n) = 2*n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A016064 (Smallest side lengths of almost-equilateral Heronian triangles)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 22 May 2022.
- ↑ Sloane, N. J. A. (ed.). "Sequence A003500 (a(n) = 4*a(n-1) - a(n-2) with a(0) = 2, a(1) = 4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 22 May 2022.
- ↑ Sloane, N. J. A. (ed.). "Sequence A335025 (Largest side lengths of almost-equilateral Heronian triangles)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 22 May 2022.
- ↑ "Sloane's A002411 : Pentagonal pyramidal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- 1 2 3 4 "Sloane's A031157 : Numbers that are both lucky and prime". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- ↑ "Sloane's A047696 : Smallest positive number that can be written in n ways as a sum of two (not necessarily positive) cubes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- ↑ Sloane, N. J. A. (ed.). "Sequence A007749 (Numbers k such that k!! - 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 24 May 2022.
- ↑ "Sloane's A082897 : Perfect totient numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- ↑ "Sloane's A016754 : Odd squares: a(n) = (2n+1)^2. Also centered octagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- ↑ Sloane, N. J. A. (ed.). "Sequence A004123 (Number of generalized weak orders on n points)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 22 May 2022.
- ↑ Sloane, N. J. A. (ed.). "Sequence A007317 (Binomial transform of Catalan numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A306445 (Number of collections of subsets of {1, 2, ..., n} that are closed under union and intersection)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 22 May 2022.
- ↑ "Sloane's A006562 : Balanced primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- ↑ Sloane, N. J. A. (ed.). "Sequence A057864 (Number of simple traceable graphs on n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 22 May 2022.
- ↑ "Sloane's A069099 : Centered heptagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- ↑ "Sloane's A016038 : Strictly non-palindromic numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- ↑ Sloane, N. J. A. (ed.). "Sequence A077269 (Number of connected squarefree graphs on n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 23 May 2022.
- ↑ "Sloane's A001107 : 10-gonal (or decagonal) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- ↑ Sloane, N. J. A. (ed.). "Sequence A018818 (Number of partitions of n into divisors of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A327070 (Number of non-connected simple labeled graphs covering n vertices)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 23 May 2022.
- ↑ Sloane, N. J. A. (ed.). "Sequence A321719 (Number of non-normal semi-magic squares with sum of entries equal to n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 30 May 2022.
- ↑ Sloane, N. J. A. (ed.). "Sequence A064628 (Floor(4^n / 3^n))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 30 May 2022.
- ↑ "Sloane's A091191 : Primitive abundant numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- ↑ "Sloane's A001106 : 9-gonal (or enneagonal or nonagonal) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- ↑ Sloane, N. J. A. (ed.). "Sequence A000712 (Generating function = Product_{m≥1} 1/(1 - x^m)^2; a(n) = number of partitions of n into parts of 2 kinds)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 30 May 2022.
- ↑ Sloane, N. J. A. (ed.). "Sequence A034295 (Number of different ways to divide an n X n square into sub-squares)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 23 May 2022.
- ↑ Sloane, N. J. A. (ed.). "Sequence A331755 (Number of vertices in a regular drawing of the complete bipartite graph K_{n,n})". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 23 May 2022.
- ↑ Sloane, N. J. A. (ed.). "Sequence A002049 (Prime numbers of measurement)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 23 May 2022.
- ↑ Sloane, N. J. A. (ed.). "Sequence A015474 (q-Fibonacci numbers for q=3)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 23 May 2022.
- ↑ "Sloane's A005448 : Centered triangular numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- ↑ "Sloane's A001844 : Centered square numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- ↑ Sloane, N. J. A. (ed.). "Sequence A036469 (Partial sums of A000009 (partitions into distinct parts))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A001189 (Number of degree-n permutations of order exactly 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 23 May 2022.
- ↑ "Sloane's A000085 : Number of self-inverse permutations on n letters, also known as involutions". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- ↑ Sloane, N. J. A. (ed.). "Sequence A002414 (Octagonal pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 23 May 2022.
- ↑ "Sloane's A005891 : Centered pentagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- ↑ Sloane, N. J. A. (ed.). "Sequence A007283 (a(n) = 3*2^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 30 May 2022.
- ↑ "Sloane's A080076 : Proth primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- ↑ Sloane, N. J. A. (ed.). "Sequence A162862 (Numbers n such that n^10 + n^9 + n^8 + n^7 + n^6 + n^5 + n^4 + n^3 + n^2 + n + 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 30 May 2022.
- ↑ Sloane, N. J. A. (ed.). "Sequence A085150 (Numbers n such that n!!!!!!+1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 30 May 2022.
- ↑ "Sloane's A000078 : Tetranacci numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- ↑ "Sloane's A005282 : Mian-Chowla sequence". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- ↑ (sequence A033453 in the OEIS)
- ↑ "Sloane's A100827 : Highly cototient numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
- ↑ Sloane, N. J. A. (ed.). "Sequence A050381 (Number of series-reduced planted trees with n leaves of 2 colors)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 24 May 2022.
- ↑ Sloane, N. J. A. (ed.). "Sequence A242882 (Number of compositions of n into parts with distinct multiplicities)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 24 May 2022.
- ↑ Sloane, N. J. A. (ed.). "Sequence A063769 (Aspiring numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A000041 (a(n) = number of partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A003154 (Centered 12-gonal numbers. Also star numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A001550 (a(n) = 1^n + 2^n + 3^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
- ↑ Sloane, N. J. A. (ed.). "Sequence A000274 (Number of permutations of length n with 2 consecutive ascending pairs)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 24 May 2022.
- ↑ Sloane, N. J. A. (ed.). "Sequence A325508 (Product of primes indexed by the prime exponents of n!)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 24 May 2022.
- ↑ Sloane, N. J. A. (ed.). "Sequence A051885 (Smallest number whose sum of digits is n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 24 May 2022.