800 (number)
Appearance
(Redirected from851 (number))
| ||||
---|---|---|---|---|
Cardinal | eight hundred | |||
Ordinal | 800th (eight hundredth) | |||
Factorization | 25× 52 | |||
Greek numeral | Ω´ | |||
Roman numeral | DCCC | |||
Binary | 11001000002 | |||
Ternary | 10021223 | |||
Senary | 34126 | |||
Octal | 14408 | |||
Duodecimal | 56812 | |||
Hexadecimal | 32016 | |||
Armenian | Պ | |||
Hebrew | ת "ת / ף | |||
Babylonian cuneiform | 𒌋𒐗⟪ | |||
Egyptirshd
| 𓍩 |
800(eight hundred) is thenatural numberfollowing799and preceding801.
It is the sum of four consecutive primes (193 + 197 + 199 + 211). It is aHarshad number,anAchilles numberand the area of asquarewith diagonal 40.[1]
Integers from 801 to 899
[edit]800s
[edit]- 801 = 32× 89, Harshad number, number of clubs patterns appearing in 50 × 50 coins[2]
- 802 = 2 × 401, sum of eight consecutive primes (83 + 89 + 97 + 101 + 103 + 107 + 109 + 113),nontotient,happy number,sum of 4 consecutive triangular numbers[3](171 + 190 + 210 + 231)
- 803 = 11 × 73, sum of three consecutive primes (263 + 269 + 271), sum of nine consecutive primes (71 + 73 + 79 + 83 + 89 + 97 + 101 + 103 + 107), Harshad number, number of partitions of 34 into Fibonacci parts[4]
- 804 = 22× 3 × 67, nontotient, Harshad number,refactorable number[5]
- "The 804" is a local nickname for theGreater Richmond Regionof the U.S. state ofVirginia,derived fromits telephone area code(although the area code covers a larger area).[citation needed]
- 805 = 5 × 7 × 23,sphenic number,number of partitions of 38 into nonprime parts[6]
- 806 = 2 × 13 × 31,sphenic number,nontotient, totient sum for first 51 integers,happy number,Phi(51)[7]
- 807 = 3 × 269, antisigma(42)[8]
- 808 = 23× 101,refactorable number,strobogrammatic number[9]
- 809 = prime number,Sophie Germain prime,[10]Chen prime,Eisenstein primewith no imaginary part
810s
[edit]- 810 = 2 × 34× 5, Harshad number, number of distinct reduced words of length 5 in the Coxeter group of "Apollonian reflections" in three dimensions,[11]number of non-equivalent ways of expressing 100,000 as the sum of two prime numbers[12]
- 811 = prime number, twin prime, sum of five consecutive primes (151 + 157 + 163 + 167 + 173), Chen prime,happy number,largestminimal primein base 9, theMertens functionof 811 returns 0
- 812 = 22× 7 × 29,admirable number,pronic number,[13]balanced number,[14]the Mertens function of 812 returns 0
- 813 = 3 × 271,Blum integer(sequenceA016105in theOEIS)
- 814 = 2 × 11 × 37, sphenic number, the Mertens function of 814 returns 0, nontotient, number of fixedhexahexes.
- 815 = 5 × 163, number of graphs with 8 vertices and a distinguished bipartite block[15]
- 816 = 24× 3 × 17,tetrahedral number,[16]Padovan number,[17]Zuckerman number
- 817 = 19 × 43, sum of three consecutive primes (269 + 271 + 277),centered hexagonal number[18]
- 818 = 2 × 409, nontotient,strobogrammatic number[9]
- 819 = 32× 7 × 13,square pyramidal number[19]
820s
[edit]- 820 = 22× 5 × 41,triangular number,smallest triangular number that starts with the digit 8[20]Harshad number,happy number,repdigit (1111) in base 9
- 821 = prime number,twin prime,Chen prime, Eisenstein prime with no imaginary part, lazy caterer number (sequenceA000124in theOEIS),prime quadrupletwith 823, 827, 829
- 822 = 2 × 3 × 137, sum of twelve consecutive primes (43 + 47 + 53 + 59 + 61 + 67 + 71 + 73 + 79 + 83 + 89 + 97), sphenic number, member of theMian–Chowla sequence[21]
- 823 = prime number,twin prime,lucky prime,the Mertens function of 823 returns 0, prime quadruplet with 821, 827, 829
- 824 = 23× 103,refactorable number,sum of ten consecutive primes (61 + 67 + 71 + 73 + 79 + 83 + 89 + 97 + 101 + 103), the Mertens function of 824 returns 0, nontotient
- 825 = 3 × 52× 11,Smith number,[22]the Mertens function of 825 returns 0, Harshad number
- 826 = 2 × 7 × 59, sphenic number, number of partitions of 29 into parts each of which is used a different number of times[23]
- 827 = prime number,twin prime,part of prime quadruplet with {821, 823, 829}, sum of seven consecutive primes (103 + 107 + 109 + 113 + 127 + 131 + 137), Chen prime, Eisenstein prime with no imaginary part, strictly non-palindromic number[24]
- 828 = 22× 32× 23, Harshad number, triangular matchstick number[25]
- 829 = prime number,twin prime,part of prime quadruplet with {827, 823, 821}, sum of three consecutive primes (271 + 277 + 281), Chen prime,centered triangular number
830s
[edit]- 830 = 2 × 5 × 83, sphenic number, sum of four consecutive primes (197 + 199 + 211 + 223), nontotient, totient sum for first 52 integers
- 831 = 3 × 277, number of partitions of 32 into at most 5 parts[26]
- 832 = 26× 13, Harshad number, member of the sequence Horadam(0, 1, 4, 2)[27]
- 833 = 72× 17,octagonal number(sequenceA000567in theOEIS), acentered octahedral number[28]
- 834 = 2 × 3 × 139,cake number,sphenic number, sum of six consecutive primes (127 + 131 + 137 + 139 + 149 + 151), nontotient
- 835 = 5 × 167,Motzkin number[29]
- 836 = 22× 11 × 19,weird number
- 837 = 33× 31, the 36th generalized heptagonal number[30]
- 838 = 2 × 419, palindromic number, number of distinct products ijk with 1 <= i<j<k <= 23[31]
- 839 = prime number,safe prime,[32]sum of five consecutive primes (157 + 163 + 167 + 173 + 179), Chen prime, Eisenstein prime with no imaginary part,highly cototient number[33]
840s
[edit]- 840 = 23× 3 × 5 × 7,highly composite number,[34]smallest number divisible by the numbers 1 to 8 (lowest common multiple of 1 to 8), sparsely totient number,[35]Harshad number in base 2 through base 10,idoneal number,balanced number,[36]sum of a twin prime (419 + 421). With 32 distinct divisors, it is the number below1000with the largest amount of divisors.
- 841 = 292= 202+ 212,sum of three consecutive primes (277 + 281 + 283), sum of nine consecutive primes (73 + 79 + 83 + 89 + 97 + 101 + 103 + 107 + 109),centered square number,[37]centered heptagonal number,[38]centered octagonal number[39]
- 842 = 2 × 421, nontotient, 842!! - 1 is prime,[40]number of series-reduced trees with 18 nodes[41]
- 843 = 3 × 281,Lucas number[42]
- 844 = 22× 211, nontotient, smallest 5 consecutive integers which are not squarefree are: 844 = 22× 211, 845 = 5 × 132,846 = 2 × 32× 47, 847 = 7 × 112and 848 = 24× 53[43]
- 845 = 5 × 132,concentric pentagonal number,[44]number of emergent parts in all partitions of 22[45]
- 846 = 2 × 32× 47, sum of eight consecutive primes (89 + 97 + 101 + 103 + 107 + 109 + 113 + 127), nontotient, Harshad number
- 847 = 7 × 112,happy number,number of partitions of 29 that do not contain 1 as a part[46]
- 848 = 24× 53,untouchable number
- 849 = 3 × 283, the Mertens function of 849 returns 0,Blum integer
850s
[edit]- 850 = 2 × 52× 17, the Mertens function of 850 returns 0, nontotient, the sum of the squares of the divisors of 26 is 850 (sequenceA001157in theOEIS). The maximum possibleFair Isaac credit score,country calling code for North Korea
- 851 = 23 × 37, number of compositions of 18 into distinct parts[47]
- 852 = 22× 3 × 71,pentagonal number,[48]Smith number[22]
- country calling code for Hong Kong
- 853 = prime number,Perrin number,[49]theMertens functionof 853 returns 0, average of first 853 prime numbers is an integer (sequenceA045345in theOEIS), strictly non-palindromic number, number of connected graphs with 7 nodes
- country calling code for Macau
- 854 = 2 × 7 × 61,sphenic number,nontotient, number of unlabeled planar trees with 11 nodes[50]
- 855 = 32× 5 × 19,decagonal number,[51]centered cube number[52]
- country calling code for Cambodia
- 856 = 23× 107,nonagonal number,[53]centered pentagonal number,[54]happy number,refactorable number
- country calling code for Laos
- 857 = prime number, sum of three consecutive primes (281 + 283 + 293), Chen prime, Eisenstein prime with no imaginary part
- 858 = 2 × 3 × 11 × 13,Giuga number[55]
- 859 = prime number, number of planar partitions of 11,[56]prime index prime
860s
[edit]- 860 = 22× 5 × 43, sum of four consecutive primes (199 + 211 + 223 + 227), Hoax number[57]
- 861 = 3 × 7 × 41, sphenic number, triangular number,[20]hexagonal number,[58]Smith number[22]
- 862 = 2 × 431, lazy caterer number (sequenceA000124in theOEIS)
- 863 = prime number, safe prime,[32]sum of five consecutive primes (163 + 167 + 173 + 179 + 181), sum of seven consecutive primes (107 + 109 + 113 + 127 + 131 + 137 + 139), Chen prime, Eisenstein prime with no imaginary part, index of prime Lucas number[59]
- 864 = 25× 33,Achilles number,sum of a twin prime (431 + 433), sum of six consecutive primes (131 + 137 + 139 + 149 + 151 + 157), Harshad number
- 865 = 5 × 173
- 866 = 2 × 433, nontotient, number of one-sidednoniamonds,[60]number of cubes of edge length 1 required to make a hollow cube of edge length 13
- 867 = 3 × 172,number of 5-chromatic simple graphs on 8 nodes[61]
- 868 = 22× 7 × 31 =J3(10),[62]nontotient
- 869 = 11 × 79, the Mertens function of 869 returns 0
870s
[edit]- 870 = 2 × 3 × 5 × 29, sum of ten consecutive primes (67 + 71 + 73 + 79 + 83 + 89 + 97 + 101 + 103 + 107), pronic number,[13]nontotient, sparsely totient number,[35]Harshad number
- This number is themagic constantofn×nnormalmagic squareandn-queens problemforn= 12.
- 871 = 13 × 67, thirteenthtridecagonal number
- 872 = 23× 109,refactorable number,nontotient, 872! + 1 isprime
- 873 = 32× 97, sum of the first six factorials from 1
- 874 = 2 × 19 × 23,sphenic number,sum of the first twenty-three primes, sum of the first seven factorials from 0, nontotient, Harshad number,happy number
- 875 = 53× 7, unique expression as difference of positive cubes:[63]103– 53
- 876 = 22× 3 × 73, generalized pentagonal number[64]
- 877 = prime number,Bell number,[65]Chen prime, the Mertens function of 877 returns 0, strictly non-palindromic number,[24]prime index prime
- 878 = 2 × 439, nontotient, number of Pythagorean triples with hypotenuse < 1000.[66]
- 879 = 3 × 293, number ofregular hypergraphsspanning 4 vertices,[67]candidateLychrelseed number
880s
[edit]- 880 = 24× 5 × 11 = 11!!!,[68]Harshad number; 148-gonal number;the number ofn×nmagic squaresfor n = 4.
- country calling code for Bangladesh
- 881 = prime number,twin prime,sum of nine consecutive primes (79 + 83 + 89 + 97 + 101 + 103 + 107 + 109 + 113), Chen prime, Eisenstein prime with no imaginary part,happy number
- 882 = 2 × 32× 72=atrinomial coefficient,[69]Harshad number, totient sum for first 53 integers, area of a square with diagonal 42[1]
- 883 = prime number,twin prime,lucky prime, sum of three consecutive primes (283 + 293 + 307), sum of eleven consecutive primes (59 + 61 + 67 + 71 + 73 + 79 + 83 + 89 + 97 + 101 + 103), the Mertens function of 883 returns 0
- 884 = 22× 13 × 17, the Mertens function of 884 returns 0, number of points on surface of tetrahedron with sidelength 21[70]
- 885 = 3 × 5 × 59,sphenic number,number of series-reduced rooted trees whose leaves are integer partitions whose multiset union is an integer partition of 7.[71]
- 886 = 2 × 443, the Mertens function of 886 returns 0
- country calling code for Taiwan
- 887 = prime number followed by primalgapof 20, safe prime,[32]Chen prime, Eisenstein prime with no imaginary part
- 888 = 23× 3 × 37, sum of eight consecutive primes (97 + 101 + 103 + 107 + 109 + 113 + 127 + 131), Harshad number,strobogrammatic number,[9]happy number,888!! - 1 is prime[72]
- 889 = 7 × 127, the Mertens function of 889 returns 0
890s
[edit]- 890 = 2 × 5 × 89 = 192+ 232(sum of squares of two successive primes),[73]sphenic number, sum of four consecutive primes (211 + 223 + 227 + 229), nontotient
- 891 = 34× 11, sum of five consecutive primes (167 + 173 + 179 + 181 + 191),octahedral number
- 892 = 22× 223, nontotient, number of regions formed by drawing the line segments connecting any two perimeter points of a 6 times 2 grid of squares likethis(sequenceA331452in theOEIS).
- 893 = 19 × 47, the Mertens function of 893 returns 0
- 894 = 2 × 3 × 149, sphenic number, nontotient
- 895 = 5 × 179, Smith number,[22]Woodall number,[74]the Mertens function of 895 returns 0
- 896 = 27× 7,refactorable number,sum of six consecutive primes (137 + 139 + 149 + 151 + 157 + 163), the Mertens function of 896 returns 0
- 897 = 3 × 13 × 23, sphenic number, Cullen number (sequenceA002064in theOEIS)
- 898 = 2 × 449, the Mertens function of 898 returns 0, nontotient
- 899 = 29 × 31 (atwin primeproduct),[75]happy number,smallest number with digit sum 26,[76]number of partitions of 51 into prime parts
References
[edit]- ^abSloane, N. J. A.(ed.)."Sequence A001105 (a(n) = 2*n^2)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^(sequenceA229093in theOEIS)
- ^(sequenceA005893in theOEIS)
- ^Sloane, N. J. A.(ed.)."Sequence A003107 (Number of partitions of n into Fibonacci parts (with a single type of 1))".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-25.
- ^Sloane, N. J. A.(ed.)."Sequence A174457 (Infinitely refactorable numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2023-10-16.
- ^Sloane, N. J. A.(ed.)."Sequence A002095 (Number of partitions of n into nonprime parts)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-25.
- ^Sloane, N. J. A.(ed.)."Sequence A002088 (Sum of totient function: a(n) = Sum_{k=1..n} phi(k), cf. A000010)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-25.
- ^Sloane, N. J. A.(ed.)."Sequence A024816 (Antisigma(n): Sum of the numbers less than n that do not divide n)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-25.
- ^abcSloane, N. J. A.(ed.)."Sequence A000787 (Strobogrammatic numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A005384 (Sophie Germain primes)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A154638 (a(n) is the number of distinct reduced words of length n in the Coxeter group of" Apollonian reflections "in three dimensions)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-25.
- ^Sloane, N. J. A.(ed.)."Sequence A065577 (Number of Goldbach partitions of 10^n)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2023-08-31.
- ^abSloane, N. J. A.(ed.)."Sequence A002378 (Oblong (or promic, pronic, or heteromecic) numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^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.
- ^Sloane, N. J. A.(ed.)."Sequence A049312 (Number of graphs with a distinguished bipartite block, by number of vertices)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-25.
- ^Sloane, N. J. A.(ed.)."Sequence A000292 (Tetrahedral numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A000931 (Padovan sequence)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A003215 (Hex (or centered hexagonal) numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A000330 (Square pyramidal numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^abSloane, N. J. A.(ed.)."Sequence A000217 (Triangular numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A005282 (Mian-Chowla sequence)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^abcdSloane, N. J. A.(ed.)."Sequence A006753 (Smith numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A098859 (Number of partitions of n into parts each of which is used a different number of times)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-25.
- ^abSloane, N. J. A.(ed.)."Sequence A016038 (Strictly non-palindromic numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^(sequenceA045943in theOEIS)
- ^Sloane, N. J. A.(ed.)."Sequence A001401 (Number of partitions of n into at most 5 parts)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-25.
- ^(sequenceA085449in theOEIS)
- ^Sloane, N. J. A.(ed.)."Sequence A001845 (Centered octahedral numbers (crystal ball sequence for cubic lattice))".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-06-02.
- ^Sloane, N. J. A.(ed.)."Sequence A001006 (Motzkin numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A085787".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-30.
- ^Sloane, N. J. A.(ed.)."Sequence A027430".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^abcSloane, N. J. A.(ed.)."Sequence A005385 (Safe primes)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A100827 (Highly cototient numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A002182 (Highly composite numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^abSloane, N. J. A.(ed.)."Sequence A036913 (Sparsely totient numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^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.
- ^Sloane, N. J. A.(ed.)."Sequence A001844 (Centered square numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A069099 (Centered heptagonal numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A016754 (Odd squares: a(n) = (2n+1)^2. Also centered octagonal numbers)".TheOn-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, N. J. A.(ed.)."Sequence A000014 (Number of series-reduced trees with n nodes)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A000032 (Lucas numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A045882 (Smallest term of first run of (at least) n consecutive integers which are not squarefree)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-24.
- ^Sloane, N. J. A.(ed.)."Sequence A032527 (Concentric pentagonal numbers: floor( 5*n^2 / 4 ))".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-24.
- ^Sloane, N. J. A.(ed.)."Sequence A182699 (Number of emergent parts in all partitions of n)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-24.
- ^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-05-24.
- ^Sloane, N. J. A.(ed.)."Sequence A032020 (Number of compositions (ordered partitions) of n into distinct parts)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-24.
- ^Sloane, N. J. A.(ed.)."Sequence A000326 (Pentagonal numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A001608 (Perrin sequence)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A002995 (Number of unlabeled planar trees (also called plane trees) with n nodes)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-24.
- ^Sloane, N. J. A.(ed.)."Sequence A001107 (10-gonal (or decagonal) numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A005898 (Centered cube numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A001106 (9-gonal (or enneagonal or nonagonal) numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A005891 (Centered pentagonal numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A007850 (Giuga numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A000219 (Number of planar partitions (or plane partitions) of n)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-24.
- ^Sloane, N. J. A.(ed.)."Sequence A019506 (Hoax numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-24.
- ^Sloane, N. J. A.(ed.)."Sequence A000384 (Hexagonal numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A001606 (Indices of prime Lucas numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A006534".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-10.
- ^Sloane, N. J. A.(ed.)."Sequence A076281 (Number of 5-chromatic (i.e., chromatic number equals 5) simple graphs on n nodes)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-24.
- ^Sloane, N. J. A.(ed.)."Sequence A059376 (Jordan function J_3(n))".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-24.
- ^Sloane, N. J. A.(ed.)."Sequence A014439 (Differences between two positive cubes in exactly 1 way.)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2019-08-18.
- ^Sloane, N. J. A.(ed.)."Sequence A001318 (Generalized pentagonal numbers.)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2019-08-26.
- ^Sloane, N. J. A.(ed.)."Sequence A000110 (Bell or exponential numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A101929 (Number of Pythagorean triples with hypotenuse < 10^n.)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-11.
- ^Sloane, N. J. A.(ed.)."Sequence A319190 (Number of regular hypergraphs)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2019-08-18.
- ^Sloane, N. J. A.(ed.)."Sequence A007661 (Triple factorial numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-11.
- ^Sloane, N. J. A.(ed.)."Sequence A111808 (Left half of trinomial triangle (A027907), triangle read by rows)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-11.
- ^Sloane, N. J. A.(ed.)."Sequence A005893 (Number of points on surface of tetrahedron)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-11.
- ^Sloane, N. J. A.(ed.)."Sequence A319312 (Number of series-reduced rooted trees whose leaves are integer partitions whose multiset union is an integer partition of n)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-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, N. J. A.(ed.)."Sequence A069484 (a(n) = prime(n+1)^2 + prime(n)^2.)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-11.
- ^Sloane, N. J. A.(ed.)."Sequence A003261 (Woodall numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A037074 (Numbers that are the product of a pair of twin primes)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-11.
- ^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-11.