700 (number)
Appearance
(Redirected from730 (number))
| ||||
---|---|---|---|---|
Cardinal | seven hundred | |||
Ordinal | 700th (seven hundredth) | |||
Factorization | 22× 52× 7 | |||
Greek numeral | Ψ´ | |||
Roman numeral | DCC | |||
Binary | 10101111002 | |||
Ternary | 2212213 | |||
Senary | 31246 | |||
Octal | 12748 | |||
Duodecimal | 4A412 | |||
Hexadecimal | 2BC16 | |||
Armenian | Չ | |||
Hebrew | ת "ש / ן | |||
Babylonian cuneiform | 𒌋𒐕𒐏 | |||
Egyptian hieroglyph | 𓍨 |
700(seven hundred) is thenatural numberfollowing699and preceding701.
It is the sum of four consecutiveprimes(167 + 173 + 179 + 181), the perimeter of a Pythagorean triangle (75 + 308 + 317)[1]and aHarshad number.
Integers from 701 to 799
[edit]Nearly all of thepalindromic integersbetween 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 forBoeing Commercial Airplanes.
700s
[edit]- 701 = prime number, sum of three consecutive primes (229 + 233 + 239),Chen prime,Eisenstein primewith no imaginary part
- 702 = 2 × 33× 13,pronic number,[2]nontotient,Harshad number
- 703 = 19 × 37,triangular number,[3]hexagonal number,[4]smallest number requiring 73 fifth powers for Waring representation,Kaprekar number,[5]area codeforNorthern Virginiaalong with571,a number commonly found in the formula forbody mass index
- 704 = 26× 11,Harshad number,lazy caterer number (sequenceA000124in theOEIS), area code for theCharlotte, NCarea.
- 705 = 3 × 5 × 47,sphenic number,smallestBruckman-Lucas pseudoprime(sequenceA005845in theOEIS)
- 706 = 2 × 353, nontotient,Smith number[6]
- 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).[7]
- 708 = 22× 3 × 59, number of partitions of 28 that do not contain 1 as a part[8]
- 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
[edit]- 710 = 2 × 5 × 71, sphenic number, nontotient, number of forests with 11 vertices[9][10]
- 711 = 32× 79, Harshad number, number of planar Berge perfect graphs on 7 nodes.[11]Also the phone number ofTelecommunications Relay Service,commonly used by the deaf and hard-of-hearing.
- 712 = 23× 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 codeforHouston, TX.InJudaismthere are 713 letters on aMezuzahscroll.
- 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,[12]member ofRuth–Aaron pair(either definition); area code forOrange County, California.
- Flight 714 to Sidneyis aTintingraphic novel.
- 714 is the badge number of SergeantJoe Friday.
- 715 = 5 × 11 × 13, sphenic number, pentagonal number,[13]pentatope number(binomial coefficient),[14]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 = 22× 179, area code forBuffalo, NY
- 717 = 3 × 239,palindromic number
- 718 = 2 × 359, area code forBrooklyn, NYandBronx, NY
- 719 = prime number,factorial prime(6! − 1),[15]Sophie Germain prime,[16]safe prime,[17]sum of seven consecutive primes (89 + 97 + 101 + 103 + 107 + 109 + 113), Chen prime, Eisenstein prime with no imaginary part
720s
[edit]- 720 = 24× 32× 5.
- 6factorial,highly composite number,Harshad numberin every base from binary to decimal,highly totient number.
- tworound angles(= 2 ×360).
- fivegross(= 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,[18]smallest number that is the difference of two positive cubes in two ways,
- 722 = 2 × 192,nontotient, number of odd parts in all partitions of 15,[19]area of a square with diagonal 38[20]
- G.722is a freely available file format for audio file compression. The files are often named with the extension "722".
- 723 = 3 × 241, side length of analmost-equilateral Heronian triangle[21]
- 724 = 22× 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 analmost-equilateral Heronian triangle,[22]the number ofn-queens problemsolutions forn= 10,
- 725 = 52× 29, side length of analmost-equilateral Heronian triangle[23]
- 726 = 2 × 3 × 112,pentagonal pyramidal number[24]
- 727 = prime number,palindromic prime,lucky prime,[25]
- 728 = 23× 7 × 13, nontotient,Smith number,[6]cabtaxi number,[26]728!! - 1 is prime,[27]number of cubes of edge length 1 required to make a hollow cube of edge length 12,72864+ 1 is prime,number of connected graphs on 5 labelled vertices
- 729 = 272= 93= 36.
- thesquareof27,and thecubeof9,the sixthpower of three,and because of these properties, aperfect totient number.[28]
- centered octagonal number,[29]Smith number[6]
- the number of times a philosopher's pleasure is greater than a tyrant's pleasure according to Plato inthe 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
[edit]- 730 = 2 × 5 × 73, sphenic number, nontotient, Harshad number, number of generalized weak orders on 5 points[30]
- 731 = 17 × 43, sum of three consecutive primes (239 + 241 + 251), number of Euler trees with total weight 7[31]
- 732 = 22× 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[32]
- 733 = prime number,emirp,balanced prime,[33]permutable prime,sum of five consecutive primes (137 + 139 + 149 + 151 + 157)
- 734 = 2 × 367, nontotient, number oftraceable graphson 7 nodes[34]
- 735 = 3 × 5 × 72,Harshad number,Zuckerman number, smallest number such that uses same digits as its distinct prime factors
- 736 = 25× 23,centered heptagonal number,[35]happy number,niceFriedman numbersince 736 = 7 + 36,Harshad number
- 737 = 11 × 67,palindromic number,blum integer.
- 738 = 2 × 32× 41, Harshad number.
- 739 = prime number, strictly non-palindromic number,[36]lucky prime,[25]happy number,prime index prime
740s
[edit]- 740 = 22× 5 × 37, nontotient, number of connected squarefree graphs on 9 nodes[37]
- 741 = 3 × 13 × 19, sphenic number, triangular number[3]
- 742 = 2 × 7 × 53, sphenic number,decagonal number,[38]icosahedral number.It is the smallest number that is one more than triple its reverse. Lazy caterer number (sequenceA000124in theOEIS). Number of partitions of 30 into divisors of 30.[39]
- 743= prime number, Sophie Germain prime, Chen prime, Eisenstein prime with no imaginary part
- 744= 23× 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'sj-invariant,and the zeroth degree term of theLaurent seriesof theJ-invariant.Furthermore, 744 = 3 × 248 where 248 is the dimension of the Lie algebraE8.
- 745 = 5 × 149 = 24+ 36,number of non-connected simple labeled graphs covering 6 vertices[40]
- 746 = 2 × 373 = 15+ 24+ 36= 17+ 24+ 36,nontotient, number of non-normal semi-magic squares with sum of entries equal to 6[41]
- 747 = 32× 83 =,[42]palindromic number.
- 748 = 22× 11 × 17, nontotient,happy number,primitive abundant number[43]
- 749 = 7 × 107, sum of three consecutive primes (241 + 251 + 257),blum integer
750s
[edit]- 750 = 2 × 3 × 53,enneagonal number.[44]
- 751 = prime number, Chen prime, emirp
- 752 = 24× 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 thecomplete bipartite graph K9,9.[47]
- 756 = 22× 33× 7, sum of six consecutive primes (109 + 113 + 127 + 131 + 137 + 139), pronic number,[2]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 theHampton Roadsarea in the U.S. state ofVirginia,derived fromthe telephone area codethat 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
[edit]- 760 = 23× 5 × 19,centered triangular number,[50]number of fixedheptominoes.
- 761 = prime number,emirp,Sophie Germain prime,[16]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,[6]admirable number,number of 1's in all partitions of 25 into odd parts,[52]see alsoSix 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 = 22× 191,telephone number[54]
- 765 = 32× 5 × 17, octagonal pyramidal number[55]
- 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(28× 3 − 1),palindromic number.
- 768 = 28× 3,[57]sum of eight consecutive primes (79 + 83 + 89 + 97 + 101 + 103 + 107 + 109)
- 769 = prime number, Chen prime, lucky prime,[25]Proth prime[58]
770s
[edit]- 770 = 2 × 5 × 7 × 11, nontotient, Harshad number
- is prime[59]
- Famous room party in New Orleans hotel room 770, giving the name to a well knownscience fiction fanzinecalledFile 770
- Holds special importancein theChabad-LubavitchHasidic movement.
- 771 = 3 × 257, sum of three consecutive primes inarithmetic progression(251 + 257 + 263). Since 771 is the product of the distinctFermat primes3 and 257, aregular polygonwith 771 sides can be constructed usingcompass and straightedge,andcan be written in terms of square roots.
- 772 = 22× 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 × 32× 43, nontotient, totient sum for first 50 integers, Harshad number
- 775 = 52× 31, member of theMian–Chowla sequence[62]
- 776 = 23× 97,refactorable number,number of compositions of 6 whose parts equal to q can be of q2kinds[63]
- 777 = 3 × 7 × 37, sphenic number, Harshad number,palindromic number,3333 insenary(base 6) counting.
- 778 = 2 × 389, nontotient, Smith number[6]
- 779 = 19 × 41,highly cototient number[66]
780s
[edit]- 780 = 22× 3 × 5 × 13, sum of four consecutiveprimesin aquadruplet(191, 193, 197, and 199); sum of ten consecutive primes (59 + 61 + 67 + 71 + 73 + 79 + 83 + 89 + 97 + 101),triangular number,[3]hexagonal number,[4]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 (sequenceA000124in theOEIS)
- 782 = 2 × 17 × 23, sphenic number, nontotient,pentagonal number,[13]Harshad number, also, 782 gear used by U.S. Marines
- 783 = 33× 29,heptagonal number
- 784 = 24× 72= 282=,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]
- 786 = 2 × 3 × 131, sphenic number,admirable number.See alsoits use in Muslim numerological symbolism.
- 787 = prime number, sum of five consecutive primes (149 + 151 + 157 + 163 + 167), Chen prime,lucky prime,[25]palindromic prime.
- 788 = 22× 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
[edit]- 790 = 2 × 5 × 79, sphenic number, nontotient, a Harshad number in bases 2, 7, 14 and 16, anaspiring 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 = 23× 32× 11, number ofinteger partitionsof 21,[70]binomial coefficient,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 = 16+ 26+ 36,[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 = 22× 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
[edit]- ^Sloane, N. J. A.(ed.)."Sequence A024364 (Ordered perimeters of primitive Pythagorean triangles)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-31.
- ^ab"Sloane's A002378: Oblong (or promic, pronic, or heteromecic) numbers".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^abc"Sloane's A000217: Triangular numbers".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^ab"Sloane's A000384: Hexagonal numbers".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^"Sloane's A006886: Kaprekar numbers".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^abcde"Sloane's A006753: Smith numbers".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^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))".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-22.
- ^Sloane, N. J. A.(ed.)."Sequence A002865 (Number of partitions of n that do not contain 1 as a part)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-06-02.
- ^Hougardy, Stefan (6 October 2006)."Classes of perfect graphs - ScienceDirect".Discrete Mathematics.Creation and Recreation: A Tribute to the Memory of Claude Berge.306(19): 2529–2571.doi:10.1016/j.disc.2006.05.021.
- ^Sloane, N. J. A.(ed.)."Sequence A005195 (Number of forests with n unlabeled nodes)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-22.
- ^Sloane, N. J. A.(ed.)."Sequence A123449 (Number of planar Berge perfect graphs on n nodes)".TheOn-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))".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^ab"Sloane's A000326: Pentagonal numbers".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^"Sloane's A000332: Binomial coefficient binomial(n,4)".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^"Sloane's A088054: Factorial primes".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^ab"Sloane's A005384: Sophie Germain primes".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^"Sloane's A005385: Safe primes".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^"Sloane's A003215: Hex (or centered hexagonal) numbers".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A066897 (Total number of odd parts in all partitions of n)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-22.
- ^Sloane, N. J. A.(ed.)."Sequence A001105".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A016064 (Smallest side lengths of almost-equilateral Heronian triangles)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-22.
- ^Sloane, N. J. A.(ed.)."Sequence A003500".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-22.
- ^Sloane, N. J. A.(ed.)."Sequence A335025 (Largest side lengths of almost-equilateral Heronian triangles)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-22.
- ^"Sloane's A002411: Pentagonal pyramidal numbers".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^abcd"Sloane's A031157: Numbers that are both lucky and prime".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^"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.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A007749 (Numbers k such that k!! - 1 is prime)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-24.
- ^"Sloane's A082897: Perfect totient numbers".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^"Sloane's A016754: Odd squares: a(n) = (2n+1)^2. Also centered octagonal numbers".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A004123 (Number of generalized weak orders on n points)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-22.
- ^Sloane, N. J. A.(ed.)."Sequence A007317 (Binomial transform of Catalan numbers)".TheOn-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)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-22.
- ^"Sloane's A006562: Balanced primes".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A057864 (Number of simple traceable graphs on n nodes)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-22.
- ^"Sloane's A069099: Centered heptagonal numbers".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^"Sloane's A016038: Strictly non-palindromic numbers".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A077269 (Number of connected squarefree graphs on n nodes)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-23.
- ^"Sloane's A001107: 10-gonal (or decagonal) numbers".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A018818 (Number of partitions of n into divisors of n)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A327070 (Number of non-connected simple labeled graphs covering n vertices)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-23.
- ^Sloane, N. J. A.(ed.)."Sequence A321719 (Number of non-normal semi-magic squares with sum of entries equal to n)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-30.
- ^Sloane, N. J. A.(ed.)."Sequence A064628 (Floor(4^n / 3^n))".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-30.
- ^"Sloane's A091191: Primitive abundant numbers".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^"Sloane's A001106: 9-gonal (or enneagonal or nonagonal) numbers".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A000712".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-30.
- ^Sloane, N. J. A.(ed.)."Sequence A034295 (Number of different ways to divide an n X n square into sub-squares)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-23.
- ^Sloane, N. J. A.(ed.)."Sequence A331755 (Number of vertices in a regular drawing of the complete bipartite graph K_{9,9})".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-23.
- ^Sloane, N. J. A.(ed.)."Sequence A002049 (Prime numbers of measurement)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-23.
- ^Sloane, N. J. A.(ed.)."Sequence A015474".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-23.
- ^"Sloane's A005448: Centered triangular numbers".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^"Sloane's A001844: Centered square numbers".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A036469 (Partial sums of A000009 (partitions into distinct parts))".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A001189 (Number of degree-n permutations of order exactly 2)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-23.
- ^"Sloane's A000085: Number of self-inverse permutations on n letters, also known as involutions".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A002414 (Octagonal pyramidal numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-23.
- ^"Sloane's A005891: Centered pentagonal numbers".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A007283".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-30.
- ^"Sloane's A080076: Proth primes".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^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)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-30.
- ^Sloane, N. J. A.(ed.)."Sequence A085150 (Numbers n such that n!!!!!!+1 is prime)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-30.
- ^"Sloane's A000078: Tetranacci numbers".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^"Sloane's A005282: Mian-Chowla sequence".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^(sequenceA033453in theOEIS)
- ^Posner, Eliezer."On the Meaning of Three".Chabad.Retrieved2 July2016.
- ^Dennis, Geoffrey."Judaism & Numbers".My Jewish Learning.Retrieved2 July2016.
- ^"Sloane's A100827: Highly cototient numbers".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A050381 (Number of series-reduced planted trees with n leaves of 2 colors)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-24.
- ^Sloane, N. J. A.(ed.)."Sequence A242882 (Number of compositions of n into parts with distinct multiplicities)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-24.
- ^Sloane, N. J. A.(ed.)."Sequence A063769 (Aspiring numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A000041 (a(n) = number of partitions of n)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A003154 (Centered 12-gonal numbers. Also star numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A001550 (a(n) = 1^n + 2^n + 3^n)".TheOn-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)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-24.
- ^Sloane, N. J. A.(ed.)."Sequence A325508 (Product of primes indexed by the prime exponents of n!)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-24.
- ^Sloane, N. J. A.(ed.)."Sequence A051885 (Smallest number whose sum of digits is n)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-24.