700 (number)

This article is about the numbers 700 through 799; for each individual number, see its section below.

← 699 700 701 →
List of numbers Integers ← 0 100 200 300 400 500 600 700 800 900 →
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	𓍨

700 (seven hundred) is the natural number following 699 and preceding 701.

It is a composite number and the sum of four consecutive primes (167 + 173 + 179 + 181).

Integers from 701 to 799

Nearly 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

• 701 = prime number, sum of three consecutive primes (229 + 233 + 239), Chen prime, Eisenstein prime with no imaginary part
• 702 = 2 × 3³ × 13, pronic number, ^[1] nontotient, Harshad number
• 703 = 19 × 37, the 37th triangular number, ^[2] a hexagonal number, ^[3] smallest number requiring 73 fifth powers for Waring representation, Kaprekar number, ^[4] area code for Northern Virginia along with 571, a number commonly found in the formula for body mass index
• 704 = 2⁶ × 11, Harshad number, lazy caterer number (sequence A000124 in the OEIS ), area code for the Charlotte, NC area.
• 705 = 3 × 5 × 47, sphenic number, smallest Bruckman-Lucas pseudoprime (sequence A005845 in the OEIS )
• 706 = 2 × 353, nontotient, Smith number ^[5]
• 707 = 7 × 101, sum of five consecutive primes (131 + 137 + 139 + 149 + 151), palindromic number, 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 = 2² × 3 × 59, number of partitions of 28 that do not contain 1 as a part ^[7]
• 709 = prime number; 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

• 710 = 2 × 5 × 71, sphenic number, nontotient, number of forests with 11 vertices ^{[8] [9]}
• 711 = 3² × 79, Harshad number, number of planar Berge perfect graphs on 7 nodes. ^[10] Also the phone number of Telecommunications Relay Service, commonly used by the deaf and hard-of-hearing.
• 712 = 2³ × 89, refactorable number, sum of the first twenty-one primes, 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 = 23 × 31, Blum integer, main area code for Houston, TX. In Judaism there are 713 letters on a Mezuzah scroll.
• 714 = 2 × 3 × 7 × 17, sum of twelve consecutive primes (37 + 41 + 43 + 47 + 53 + 59 + 61 + 67 + 71 + 73 + 79 + 83), nontotient, balanced number, ^[11] member of Ruth–Aaron pair (either definition); 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 = 5 × 11 × 13, sphenic number, pentagonal number, ^[12] pentatope number ( binomial coefficient ${\displaystyle {\tbinom {13}{4}}}$ ), ^[13] Harshad number, member of Ruth-Aaron pair (either definition)
• The product of 714 and 715 is the product of the first 7 prime numbers (2, 3, 5, 7, 11, 13, and 17)
• 716 = 2² × 179, area code for Buffalo, NY
• 717 = 3 × 239, palindromic number
• 718 = 2 × 359, area code for Brooklyn, NY and Bronx, NY
• 719 = prime number, factorial prime (6! − 1), ^[14] Sophie Germain prime, ^[15] safe prime, ^[16] sum of seven consecutive primes (89 + 97 + 101 + 103 + 107 + 109 + 113), Chen prime, Eisenstein prime with no imaginary part

720s

Main article: 720 (number)

• 720 = 2⁴ × 3² × 5.
  • 6 factorial, highly composite number, Harshad number in every base from binary to decimal, highly totient number.
  • two round angles (= 2 × 360).
  • five gross (= 500 duodecimal, 5 × 144).
  • 241-gonal number.
• 721 = 7 × 103, sum of nine consecutive primes (61 + 67 + 71 + 73 + 79 + 83 + 89 + 97 + 101), centered hexagonal number, ^[17] smallest number that is the difference of two positive cubes in two ways,
• 722 = 2 × 19², nontotient, number of odd parts in all partitions of 15, ^[18] area of a square with diagonal 38 ^[19]
  • G.722 is a freely available file format for audio file compression. The files are often named with the extension "722".
• 723 = 3 × 241, side length of an almost-equilateral Heronian triangle ^[20]
• 724 = 2² × 181, sum of four consecutive primes (173 + 179 + 181 + 191), sum of six consecutive primes (107 + 109 + 113 + 127 + 131 + 137), nontotient, side length of an almost-equilateral Heronian triangle, ^[21] the number of n-queens problem solutions for n = 10,
• 725 = 5² × 29, side length of an almost-equilateral Heronian triangle ^[22]
• 726 = 2 × 3 × 11², pentagonal pyramidal number ^[23]
• 727 = prime number, palindromic prime, lucky prime, ^[24]
• 728 = 2³ × 7 × 13, nontotient, Smith number, ^[5] cabtaxi number, ^[25] 728!! - 1 is prime, ^[26] number of cubes of edge length 1 required to make a hollow cube of edge length 12, 728⁶⁴ + 1 is prime, number of connected graphs on 5 labelled vertices
• 729 = 27² = 9³ = 3⁶.
  • the square of 27, and the cube of 9, the sixth power of three, and because of these properties, a perfect totient number. ^[27]
  • centered octagonal number, ^[28] Smith number ^[5]
  • the number of times a philosopher king's pleasure is greater than a tyrant's pleasure according to Plato in the Republic
  • 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)

730s

• 730 = 2 × 5 × 73, sphenic number, nontotient, Harshad number, number of generalized weak orders on 5 points ^[29]
• 731 = 17 × 43, sum of three consecutive primes (239 + 241 + 251), number of Euler trees with total weight 7 ^[30]
• 732 = 2² × 3 × 61, sum of eight consecutive primes (73 + 79 + 83 + 89 + 97 + 101 + 103 + 107), sum of ten consecutive primes (53 + 59 + 61 + 67 + 71 + 73 + 79 + 83 + 89 + 97), Harshad number, number of collections of subsets of {1, 2, 3, 4} that are closed under union and intersection ^[31]
• 733 = prime number, emirp, balanced prime, ^[32] permutable prime, sum of five consecutive primes (137 + 139 + 149 + 151 + 157)
• 734 = 2 × 367, nontotient, number of traceable graphs on 7 nodes ^[33]
• 735 = 3 × 5 × 7², Harshad number, Zuckerman number, smallest number such that uses same digits as its distinct prime factors
• 736 = 2⁵ × 23, centered heptagonal number, ^[34] happy number, nice Friedman number since 736 = 7 + 3⁶, Harshad number
• 737 = 11 × 67, palindromic number, blum integer.
• 738 = 2 × 3² × 41, Harshad number.
• 739 = prime number, strictly non-palindromic number, ^[35] lucky prime, ^[24] happy number, prime index prime

740s

• 740 = 2² × 5 × 37, nontotient, number of connected squarefree graphs on 9 nodes ^[36]
• 741 = 3 × 13 × 19, sphenic number, 38th triangular number ^[2]
• 742 = 2 × 7 × 53, sphenic number, decagonal number, ^[37] icosahedral number. It is the smallest number that is one more than triple its reverse. Lazy caterer number (sequence A000124 in the OEIS ). Number of partitions of 30 into divisors of 30. ^[38]
• 743 = prime number, Sophie Germain prime, Chen prime, Eisenstein prime with no imaginary part
• 744 = 2³ × 3 × 31, sum of four consecutive primes (179 + 181 + 191 + 193). It is the coefficient of the first degree term of the expansion of Klein's j-invariant, and the zeroth degree term of the Laurent series of the J-invariant. Furthermore, 744 = 3 × 248 where 248 is the dimension of the Lie algebra E₈.
• 745 = 5 × 149 = 2⁴ + 3⁶, number of non-connected simple labeled graphs covering 6 vertices ^[39]
• 746 = 2 × 373 = 1⁵ + 2⁴ + 3⁶ = 1⁷ + 2⁴ + 3⁶, nontotient, number of non-normal semi-magic squares with sum of entries equal to 6 ^[40]
• 747 = 3² × 83 = ${\displaystyle \left\lfloor {\frac {4^{23}}{3^{23}}}\right\rfloor }$, ^[41] palindromic number.
• 748 = 2² × 11 × 17, nontotient, happy number, primitive abundant number ^[42]
• 749 = 7 × 107, sum of three consecutive primes (241 + 251 + 257), blum integer

750s

• 750 = 2 × 3 × 5³, enneagonal number. ^[43]
• 751 = prime number with a prime number of prime digits, ^[44] Chen prime, emirp,
• 752 = 2⁴ × 47, nontotient, number of partitions of 11 into parts of 2 kinds ^[45]
• 753 = 3 × 251, blum integer
• 754 = 2 × 13 × 29, sphenic number, nontotient, totient sum for first 49 integers, number of different ways to divide a 10 × 10 square into sub-squares ^[46]
• 755 = 5 × 151, number of vertices in a regular drawing of the complete bipartite graph K_9,9. ^[47]
• 756 = 2² × 3³ × 7, sum of six consecutive primes (109 + 113 + 127 + 131 + 137 + 139), pronic number, ^[1] Harshad number
• 757 = prime number, palindromic prime, sum of seven consecutive primes (97 + 101 + 103 + 107 + 109 + 113 + 127), happy number.
  • "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 = 2 × 379, nontotient, prime number of measurement ^[48]
• 759 = 3 × 11 × 23, sphenic number, sum of five consecutive primes (139 + 149 + 151 + 157 + 163), a q-Fibonacci number for q=3 ^[49]

760s

• 760 = 2³ × 5 × 19, centered triangular number, ^[50] number of fixed heptominoes.
• 761 = prime number, emirp, Sophie Germain prime, ^[15] Chen prime, Eisenstein prime with no imaginary part, centered square number ^[51]
• 762 = 2 × 3 × 127, sphenic number, sum of four consecutive primes (181 + 191 + 193 + 197), nontotient, Smith number, ^[5] admirable number, number of 1's in all partitions of 25 into odd parts, ^[52] see also Six nines in pi
• 763 = 7 × 109, sum of nine consecutive primes (67 + 71 + 73 + 79 + 83 + 89 + 97 + 101 + 103), number of degree-8 permutations of order exactly 2 ^[53]
• 764 = 2² × 191, telephone number ^[54]
• 765 = 3² × 5 × 17, octagonal pyramidal number ^[55]
  • a Japanese word-play for Namco;
• 766 = 2 × 383, centered pentagonal number, ^[56] nontotient, sum of twelve consecutive primes (41 + 43 + 47 + 53 + 59 + 61 + 67 + 71 + 73 + 79 + 83 + 89)
• 767 = 13 × 59, Thabit number (2⁸ × 3 − 1), palindromic number.
• 768 = 2⁸ × 3, ^[57] sum of eight consecutive primes (79 + 83 + 89 + 97 + 101 + 103 + 107 + 109)
• 769 = prime number, Chen prime, lucky prime, ^[24] Proth prime ^[58]

770s

• 770 = 2 × 5 × 7 × 11, nontotient, Harshad number
  • ${\displaystyle \sum _{n=0}^{10}770^{n}}$ is prime ^[59]
  • Famous room party in New Orleans hotel room 770, giving the name to a well known science fiction fanzine called File 770
  • Holds special importance in the Chabad-Lubavitch Hasidic movement.
• 771 = 3 × 257, 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 ${\displaystyle \cos \left({\frac {2\pi }{771}}\right)}$ can be written in terms of square roots.
• 772 = 2² × 193, 772!!!!!!+1 is prime ^[60]
• 773 = prime number, Eisenstein prime with no imaginary part, tetranacci number, ^[61] prime index prime, sum of the number of cells that make up the convex, regular 4-polytopes
• 774 = 2 × 3² × 43, nontotient, totient sum for first 50 integers, Harshad number
• 775 = 5² × 31, member of the Mian–Chowla sequence ^[62]
• 776 = 2³ × 97, refactorable number, number of compositions of 6 whose parts equal to q can be of q² kinds ^[63]

Main article: 777 (number)

• 777 = 3 × 7 × 37, sphenic number, Harshad number, palindromic number, 3333 in senary (base 6) counting.
  • The numbers 3 and 7 are considered both "perfect numbers" under Hebrew tradition. ^{[64] [65]}
• 778 = 2 × 389, nontotient, Smith number ^[5]
• 779 = 19 × 41, highly cototient number ^[66]

780s

• 780 = 2² × 3 × 5 × 13, sum of four consecutive primes in a quadruplet (191, 193, 197, and 199); sum of ten consecutive primes (59 + 61 + 67 + 71 + 73 + 79 + 83 + 89 + 97 + 101), 39th triangular number, ^[2] a hexagonal number, ^[3] Harshad number
  • 780 and 990 are the fourth smallest pair of triangular numbers whose sum and difference (1770 and 210) are also triangular.
• 781 = 11 × 71. 781 is the sum of powers of 5/repdigit in base 5 (11111), Mertens function(781) = 0, lazy caterer number (sequence A000124 in the OEIS )
• 782 = 2 × 17 × 23, sphenic number, nontotient, pentagonal number, ^[12] Harshad number, also, 782 gear used by U.S. Marines
• 783 = 3³ × 29, heptagonal number
• 784 = 2⁴ × 7² = 28² = ${\displaystyle 1^{3}+2^{3}+3^{3}+4^{3}+5^{3}+6^{3}+7^{3}}$, the sum of the cubes of the first seven positive integers, happy number
• 785 = 5 × 157, Mertens function(785) = 0, number of series-reduced planted trees with 6 leaves of 2 colors ^[67]

Main article: 786 (number)

• 786 = 2 × 3 × 131, sphenic number, admirable number. See also its use in Muslim numerological symbolism.
• 787 = prime number, sum of five consecutive primes (149 + 151 + 157 + 163 + 167), Chen prime, lucky prime, ^[24] palindromic prime.
• 788 = 2² × 197, nontotient, number of compositions of 12 into parts with distinct multiplicities ^[68]
• 789 = 3 × 263, sum of three consecutive primes (257 + 263 + 269), Blum integer

790s

• 790 = 2 × 5 × 79, sphenic number, nontotient, a Harshad number in bases 2, 7, 14 and 16, an aspiring number, ^[69] the aliquot sum of 1574.
• 791 = 7 × 113, centered tetrahedral number, sum of the first twenty-two primes, sum of seven consecutive primes (101 + 103 + 107 + 109 + 113 + 127 + 131)
• 792 = 2³ × 3² × 11, number of integer partitions of 21, ^[70] binomial coefficient ${\displaystyle {\tbinom {12}{5}}}$, Harshad number, sum of the nontriangular numbers between successive triangular numbers
• 793 = 13 × 61, Mertens function(793) = 0, star number, ^[71] happy number
• 794 = 2 × 397 = 1⁶ + 2⁶ + 3⁶, ^[72] nontotient
• 795 = 3 × 5 × 53, sphenic number, Mertens function(795) = 0, number of permutations of length 7 with 2 consecutive ascending pairs ^[73]
• 796 = 2² × 199, sum of six consecutive primes (113 + 127 + 131 + 137 + 139 + 149), Mertens function(796) = 0
• 797 = prime number, Chen prime, Eisenstein prime with no imaginary part, palindromic prime, two-sided prime, prime index prime.
• 798 = 2 × 3 × 7 × 19, Mertens function(798) = 0, nontotient, product of primes indexed by the prime exponents of 10! ^[74]
• 799 = 17 × 47, smallest number with digit sum 25 ^[75]

References

1. "Sloane's A002378 : Oblong (or promic, pronic, or heteromecic) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
2. "Sloane's A000217 : Triangular numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
3. "Sloane's A000384 : Hexagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
4. "Sloane's A006886 : Kaprekar numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
5. "Sloane's A006753 : Smith numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
6. Sloane, N. J. A. (ed.). "SequenceA026671(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.
7. Sloane, N. J. A. (ed.). "SequenceA002865(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.
8. Hougardy, Stefan (October 2006). "Classes of perfect graphs". Discrete Mathematics. 306 (19–20): 2529–2571. doi: 10.1016/j.disc.2006.05.021 .
9. Sloane, N. J. A. (ed.). "SequenceA005195(Number of forests with n unlabeled nodes)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 22 May 2022.
10. Sloane, N. J. A. (ed.). "SequenceA123449(Number of planar Berge perfect graphs on n nodes)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
11. Sloane, N. J. A. (ed.). "SequenceA020492(Balanced numbers: numbers k such that phi(k) (A000010) divides sigma(k) (A000203))". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
12. "Sloane's A000326 : Pentagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
13. "Sloane's A000332 : Binomial coefficient binomial(n,4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
14. "Sloane's A088054 : Factorial primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
15. "Sloane's A005384 : Sophie Germain primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
16. "Sloane's A005385 : Safe primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
17. "Sloane's A003215 : Hex (or centered hexagonal) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
18. Sloane, N. J. A. (ed.). "SequenceA066897(Total number of odd parts in all partitions of n)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 22 May 2022.
19. Sloane, N. J. A. (ed.). "SequenceA001105(a(n) = 2*n^2)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
20. Sloane, N. J. A. (ed.). "SequenceA016064(Smallest side lengths of almost-equilateral Heronian triangles)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 22 May 2022.
21. Sloane, N. J. A. (ed.). "SequenceA003500(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.
22. Sloane, N. J. A. (ed.). "SequenceA335025(Largest side lengths of almost-equilateral Heronian triangles)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 22 May 2022.
23. "Sloane's A002411 : Pentagonal pyramidal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
24. "Sloane's A031157 : Numbers that are both lucky and prime". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
25. "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.
26. Sloane, N. J. A. (ed.). "SequenceA007749(Numbers k such that k!! - 1 is prime)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 24 May 2022.
27. "Sloane's A082897 : Perfect totient numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
28. "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.
29. Sloane, N. J. A. (ed.). "SequenceA004123(Number of generalized weak orders on n points)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 22 May 2022.
30. Sloane, N. J. A. (ed.). "SequenceA007317(Binomial transform of Catalan numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
31. Sloane, N. J. A. (ed.). "SequenceA306445(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.
32. "Sloane's A006562 : Balanced primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
33. Sloane, N. J. A. (ed.). "SequenceA057864(Number of simple traceable graphs on n nodes)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 22 May 2022.
34. "Sloane's A069099 : Centered heptagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
35. "Sloane's A016038 : Strictly non-palindromic numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
36. Sloane, N. J. A. (ed.). "SequenceA077269(Number of connected squarefree graphs on n nodes)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 23 May 2022.
37. "Sloane's A001107 : 10-gonal (or decagonal) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
38. Sloane, N. J. A. (ed.). "SequenceA018818(Number of partitions of n into divisors of n)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
39. Sloane, N. J. A. (ed.). "SequenceA327070(Number of non-connected simple labeled graphs covering n vertices)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 23 May 2022.
40. Sloane, N. J. A. (ed.). "SequenceA321719(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.
41. Sloane, N. J. A. (ed.). "SequenceA064628(Floor(4^n / 3^n))". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 30 May 2022.
42. "Sloane's A091191 : Primitive abundant numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
43. "Sloane's A001106 : 9-gonal (or enneagonal or nonagonal) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
44. Sloane, N. J. A. (ed.). "SequenceA348699(Primes with a prime number of prime digits)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
45. Sloane, N. J. A. (ed.). "SequenceA000712(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.
46. Sloane, N. J. A. (ed.). "SequenceA034295(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.
47. Sloane, N. J. A. (ed.). "SequenceA331755(Number of vertices in a regular drawing of the complete bipartite graph K_{9,9})". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 23 May 2022.
48. Sloane, N. J. A. (ed.). "SequenceA002049(Prime numbers of measurement)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 23 May 2022.
49. Sloane, N. J. A. (ed.). "SequenceA015474(q-Fibonacci numbers for q=3)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 23 May 2022.
50. "Sloane's A005448 : Centered triangular numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
51. "Sloane's A001844 : Centered square numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
52. Sloane, N. J. A. (ed.). "SequenceA036469(Partial sums of A000009 (partitions into distinct parts))". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
53. Sloane, N. J. A. (ed.). "SequenceA001189(Number of degree-n permutations of order exactly 2)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 23 May 2022.
54. "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.
55. Sloane, N. J. A. (ed.). "SequenceA002414(Octagonal pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 23 May 2022.
56. "Sloane's A005891 : Centered pentagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
57. Sloane, N. J. A. (ed.). "SequenceA007283(a(n) = 3*2^n)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 30 May 2022.
58. "Sloane's A080076 : Proth primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
59. Sloane, N. J. A. (ed.). "SequenceA162862(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.
60. Sloane, N. J. A. (ed.). "SequenceA085150(Numbers n such that n!!!!!!+1 is prime)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 30 May 2022.
61. "Sloane's A000078 : Tetranacci numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
62. "Sloane's A005282 : Mian-Chowla sequence". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
63. (sequence A033453 in the OEIS )
64. Posner, Eliezer. "On the Meaning of Three". Chabad. Retrieved 2 July 2016.
65. Dennis, Geoffrey. "Judaism & Numbers". My Jewish Learning. Retrieved 2 July 2016.
66. "Sloane's A100827 : Highly cototient numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
67. Sloane, N. J. A. (ed.). "SequenceA050381(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.
68. Sloane, N. J. A. (ed.). "SequenceA242882(Number of compositions of n into parts with distinct multiplicities)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 24 May 2022.
69. Sloane, N. J. A. (ed.). "SequenceA063769(Aspiring numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
70. Sloane, N. J. A. (ed.). "SequenceA000041(a(n) = number of partitions of n)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
71. Sloane, N. J. A. (ed.). "SequenceA003154(Centered 12-gonal numbers. Also star numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
72. Sloane, N. J. A. (ed.). "SequenceA001550(a(n) = 1^n + 2^n + 3^n)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
73. Sloane, N. J. A. (ed.). "SequenceA000274(Number of permutations of length n with 2 consecutive ascending pairs)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 24 May 2022.
74. Sloane, N. J. A. (ed.). "SequenceA325508(Product of primes indexed by the prime exponents of n!)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 24 May 2022.
75. Sloane, N. J. A. (ed.). "SequenceA051885(Smallest number whose sum of digits is n)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation. Retrieved 24 May 2022.