800 (number)

← 799 800 801 →
Cardinaleight hundred
Ordinal800th
(eight hundredth)
Factorization25 × 52
Divisors1, 2, 4, 5, 8, 10, 16, 20, 25, 32, 40, 50, 80, 100, 160, 200, 400, 800
Greek numeralΩ´
Roman numeralDCCC, dccc
Binary11001000002
Ternary10021223
Senary34126
Octal14408
Duodecimal56812
Hexadecimal32016
ArmenianՊ
Hebrewת"ת / ף
Babylonian cuneiform𒌋𒐗⟪
Egyptian hieroglyph𓍩

800 (eight hundred) is the natural number following 799 and preceding 801.

In mathematics

It is the sum of four consecutive primes (193 + 197 + 199 + 211). It is a Harshad number, an Achilles number and the area of a square with diagonal 40.

Integers from 801 to 899

800s

801

801 is 3*3*89 and a Harshad number. 801 is the sum of a square and positive cube in more than one way, and a sum of distinct positive cubes in more than one way:

In the gematria of 2nd century bishop Irenaeus, 801 stands for both the Greek word for a dove, and for Alpha and Omega, and therefore represents God in two ways.

There are 801 club patterns in a 50x50 grid of coins.

802

802 = 2 × 401. It is a nontotient, a happy number, the sum of eight consecutive primes (83 + 89 + 97 + 101 + 103 + 107 + 109 + 113), and the sum of 4 consecutive triangular numbers (171 + 190 + 210 + 231).

803

803 = 11 × 73. It is a Harshad number, the sum of three consecutive primes (263 + 269 + 271), and the sum of nine consecutive primes (71 + 73 + 79 + 83 + 89 + 97 + 101 + 103 + 107).

There are 803 partitions of 34 into Fibonacci parts.

804

804 = 22 × 3 × 67. It is a nontotient, a Harshad number, and a refactorable number.

"The 804" is a local nickname for the Greater Richmond Region of the U.S. state of Virginia, derived from its telephone area code (although the area code covers a larger area).

805

805 = 5 × 7 × 23. It is a sphenic number. There are 805 partitions of 38 into nonprime parts

806

806 = 2 × 13 × 31. It is a sphenic number, a nontotient, a happy number, and the totient sum for first 51 integers.

806 = Phi(51)

807

807 = 3 × 269 = antisigma(42)

808

808 = 23 × 101. It is a refactorable number and a strobogrammatic number.

809

809 is a prime number, a Sophie Germain prime, a Chen prime, and an Eisenstein prime with no imaginary part.

810s

810

810 = 2 × 34 × 5. It is a harshad number. There are 810 non-equivalent ways of expressing 100,000 as the sum of two prime numbers. There are 810 distinct reduced words of length 5 in the Coxeter group of "Apollonian reflections" in three dimensions.

811

811 is a prime number, a twin prime, a Chen prime, the largest minimal prime in base 9, and the sum of five consecutive primes (151 + 157 + 163 + 167 + 173). It is a happy number and a zero of Mertens function.

812

812 = 22 × 7 × 29. It is an admirable number, a pronic number, a balanced number, and a zero of Mertens function.

813

813 = 3 × 271. It is a Blum integer.

814

814 = 2 × 11 × 37. It is a sphenic number, a nontotient, and a zero of Mertens function. There are 814 fixed hexahexes.

815

815 = 5 × 163. There are 815 graphs with 8 vertices and a distinguished bipartite block.

816

816 = 24 × 3 × 17. It is a tetrahedral number, a Padovan number, and a Zuckerman number.

817

817 = 19 × 43. It is a centered hexagonal number and the sum of three consecutive primes (269 + 271 + 277).

818

818 = 2 × 409. It is a nontotient and a strobogrammatic number

819

819 = 32 × 7 × 13. It is a square pyramidal number.

820s

820

820 = 22 × 5 × 41. It is a Harshad number, a happy number, a repdigit (1111) in base 9, and the 40th triangular number.

821

821 is a prime number, a twin prime, a Chen prime, and an Eisenstein prime with no imaginary part. It forms a prime quadruplet with 823, 827, and 829. It is a lazy caterer number.

822

822 = 2 × 3 × 137. It is a sphenic number, a member of the Mian–Chowla sequence, and the sum of twelve consecutive primes (43 + 47 + 53 + 59 + 61 + 67 + 71 + 73 + 79 + 83 + 89 + 97).

823

823 is a prime number, a twin prime, and a lucky prime. It forms a prime quadruplet with 821, 827, and 829. It is a zero of Mertens function.

824

824 = 23 × 103, refactorable number, nontotient, a zero of Mertens function, and the sum of ten consecutive primes (61 + 67 + 71 + 73 + 79 + 83 + 89 + 97 + 101 + 103).

825

825 = 3 × 52 × 11. It is a Smith number, a Harshad number, and a zero of Mertens function.

826

826 = 2 × 7 × 59. It is a sphenic number. There are 825 partitions of 29 into parts each of which is used a different number of times.

827

827 is a prime number, a twin prime, a Chen prime, a Eisenstein prime with no imaginary part, and the sum of seven consecutive primes (103 + 107 + 109 + 113 + 127 + 131 + 137). It forms a prime quadruplet with 821, 823, and 829. It is a strictly non-palindromic number.

828

828 = 22 × 32 × 23. It is a Harshad number and a triangular matchstick number.

829

829 is a prime number, a twin prime, a Chen prime, and the sum of three consecutive primes (271 + 277 + 281). It forms a prime quadruplet with 821, 823, and 827. It is a centered triangular number.

830s

830

830 = 2 × 5 × 83. It is a sphenic number, a nontotient, the totient sum of the first 52 integers, and the sum of four consecutive primes (197 + 199 + 211 + 223).

831

831 = 3 × 277. There are 831 partitions of 32 into at most 5 parts.

832

832 = 26 × 13. It is a Harshad number and a member of the Horadam sequence (0,1,4,2).

833

833 = 72 × 17. It is an octagonal number and a centered octahedral number.

834

834 = 2 × 3 × 139. It is a cake number, a sphenic number, a nontotient, and the sum of six consecutive primes (127 + 131 + 137 + 139 + 149 + 151).

835

835 = 5 × 167. It is a Motzkin number.

836

837

837 = 33 × 31. It is the 36th generalized heptagonal number.

838

838 = 2 × 419. It is a palindromic number. There are 838 distinct products ijk with 1 <= i<j<k <= 23.

839

839 is a prime number, a safe prime, a Chen prime, an Eisenstein prime with no imaginary part, and the sum of five consecutive primes (157 + 163 + 167 + 173 + 179). It is a highly cototient number.

840s

840

841

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, centered heptagonal number, centered octagonal number

842

842 = 2 × 421. It is a nontotient. There are 842 series-reduced trees with 18 nodes.

842!! - 1 is prime.

843

843 = 3 × 281. It is a Lucas number.

844

844 = 22 × 211. It is a nontotient. It is the smallest 5 consecutive integers which are not squarefree:

844 = 22 × 211, 845 = 5 × 132, 846 = 2 × 32 × 47, 847 = 7 × 112, and 848 = 24 × 53.

845

845 = 5 × 132. It is a concentric pentagonal number.There are 845 emergent parts in all partitions of 22.

846

846 = 2 × 32 × 47. It is a nontotient, a Harshad number, and the sum of eight consecutive primes (89 + 97 + 101 + 103 + 107 + 109 + 113 + 127).

847

847 = 7 × 112. It is a happy number. There are 847 partitions of 29 that do not contain 1 as a part.

848

848 = 24 × 53. It is an untouchable number.

849

849 = 3 × 283, It is a zero of Mertens function and a Blum integer.

850s

850

850 = 2 × 52 × 17. It is a zero of Mertens function and a nontotient. The sum of the squares of the divisors of 26 is 850 (sequence A001157 in the OEIS).

The maximum possible Fair Isaac credit score is 850.

851

851 = 23 × 37 There are 851 compositions of 18 into distinct parts

852

852 = 22 × 3 × 71. It is a pentagonal number and a Smith number.

853

853 is a prime number, a Perrin number, a zero of Mertens function, and a strictly non-palindromic number. The average of first 853 prime numbers is an integer (sequence A045345 in the OEIS). There are 853 connected graphs with 7 nodes.

854

854 = 2 × 7 × 61. It is a sphenic number and a nontotient. There are 854 unlabeled planar trees with 11 nodes.

855

855 = 32 × 5 × 19. It is a decagonal number and a centered cube number.

856

856 = 23 × 107. It is a nonagonal number, a centered pentagonal number, and a refactorable number.

857

857 is a prime number, a Chen prime, an Eisenstein prime with no imaginary part, and the sum of three consecutive primes (281 + 283 + 293).

858

858 = 2 × 3 × 11 × 13. It is a Giuga number.

859

859 is a prime number and a prime index prime. There are 859 planar partitions of 11.

860s

860

860 = 22 × 5 × 43. It is aHoax number and the sum of four consecutive primes (199 + 211 + 223 + 227).

861

861 = 3 × 7 × 41. It is a sphenic number, a hexagonal number, a Smith number, and the 41st triangular number.

862

862 = 2 × 431. It is a lazy caterer number.

863

863 is a prime number, a safe prime, a Chen prime, an Eisenstein prime with no imaginary part, and an index of a prime Lucas number.It is the sum of five consecutive primes (163 + 167 + 173 + 179 + 181) and the sum of seven consecutive primes (107 + 109 + 113 + 127 + 131 + 137 + 139).

864

864 = 25 × 33. It is an Achilles number and a Harshad number. It the sum of a twin prime pair (431 + 433) and the sum of six consecutive primes (131 + 137 + 139 + 149 + 151 + 157).

865

865 = 5 × 173.

866

866 = 2 × 433. It is a nontotient and the number of cubes of edge length 1 required to make a hollow cube of edge length 13. There are 866 one-sided noniamonds.

867

867 = 3 × 172. There are 867 5-chromatic simple graphs on 8 nodes.

868

868 = 22 × 7 × 31 = J3(10). It is a nontotient.

869

869 = 11 × 79. It is a zero of Mertens function.

870s

870

870 = 2 × 3 × 5 × 29. It is a pronic number, a nontotient, a sparsely totient number, a Harshad number, and the sum of ten consecutive primes (67 + 71 + 73 + 79 + 83 + 89 + 97 + 101 + 103 + 107). It is the magic constant of n×n normal magic square and n-queens problem for n = 12.

871

871 = 13 × 67. It is the thirteenth tridecagonal number.

872

872 = 23 × 109. It is a refactorable number and anontotient.

872! + 1 is prime.

873

873 = 32 × 97 = 1! + 2! + 3! + 4! + 5! + 6!.

874

874 = 2 × 19 × 23 = 0! + 1! + 2! + 3! + 4! + 5! + 6!. It is a sphenic number, a nontotient, a Harshad number, a happy number, and the sum of the first twenty-three primes.

875

875 = 53 × 7. It can be uniquely expressed as a difference of two positive cubes: 875 = 103 – 53.

876

876 = 22 × 3 × 73. It is a generalized pentagonal number.

877

877 is a prime number, a prime index prime, a Chen prime, a zero of Mertens function, a Bell number, and a strictly non-palindromic number.

878

878 = 2 × 439. It is a nontotient. There are 878 Pythagorean triples with a hypotenuse less than 1000.

879

879 = 3 × 293. It is a candidate Lychrel seed number. There are 879 regular hypergraphs spanning 4 vertices.

880s

880

880 = 24 × 5 × 11 = 11!!!. It is a Harshad number and a 148-gonal number. There are 880 n×n magic squares for n = 4.

881

881 is a prime number, a twin prime, a Chen prime, an Eisenstein prime with no imaginary part, and the sum of nine consecutive primes (79 + 83 + 89 + 97 + 101 + 103 + 107 + 109 + 113). It is a happy number.

881 is a bilingual play on words when text chatting in Mandarin Chinese or bilingually Mandarin Chinese and English. "881" is pronounced ba ba yi in Mandarin, and thus puns on "bye-bye." Probably an elaboration of the similar pun on "88" (ba-ba). See 88 (number).[citation needed]

882

882 = 2 × 32 × 72 = It is a trinomial coefficient, a Harshad number, and the totient sum of the first 53 integers.

883

883 is a prime number, a twin prime, a lucky prime, the sum of three consecutive primes (283 + 293 + 307), and the sum of eleven consecutive primes (59 + 61 + 67 + 71 + 73 + 79 + 83 + 89 + 97 + 101 + 103). It is a zero of Mertens function.

884

884 = 22 × 13 × 17. It is a zero of Mertens function. There are 884 points on surface of tetrahedron with sidelength 21.

885

885 = 3 × 5 × 59. It is a sphenic number. There are 885 series-reduced rooted trees whose leaves are integer partitions whose multiset union is an integer partition of 7.

886

886 = 2 × 443. It is a zero of Mertens function.

887

887 is a prime number followed by primal gap of 20, a safe prime, a Chen prime, and an Eisenstein prime with no imaginary part. It is the first iteration of the 196 trajectory (196 + 691 = 887).

888

889

889 = 7 × 127. It is a zero of Mertens function.

890s

890

890 = 2 × 5 × 89. It is a sphenic number, a nontotient, and the sum of four consecutive primes (211 + 223 + 227 + 229). 890 is the sum of the squares of two successive primes: 890 = 192 + 232.

891

891 = 34 × 11. It is an octahedral number and the sum of five consecutive primes (167 + 173 + 179 + 181 + 191).

892

892 = 22 × 223. It is a nontotient. There are 892 regions formed by drawing the line segments connecting any two perimeter points of a 6 times 2 grid of squares like this (sequence A331452 in the OEIS).

893

893 = 19 × 47. It is a zero of Mertens function.

893 is considered an unlucky number in Japan, because its digits read sequentially are the literal translation of yakuza.

894

894 = 2 × 3 × 149. It is a sphenic number and a nontotient.

895

895 = 5 × 179. It is a Smith number, a Woodall number, and a zero of Mertens function.

896

896 = 27 × 7. It is a refactorable number, a zero of Mertens function, and the sum of six consecutive primes (137 + 139 + 149 + 151 + 157 + 163).

897

897 = 3 × 13 × 23. It is a sphenic number and a Cullen number (sequence A002064 in the OEIS).

898

898 = 2 × 449. It is a nontotient and a zero of Mertens function.

899

899 = 29 × 31. It is the product of a pair of twin primes, a happy number, and the smallest number with digit sum 26. There are 899 partitions of 51 into prime parts.

References

  1. ↑ Sloane, N. J. A. (ed.). "Sequence A001105 (a(n) = 2*n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  2. ↑ Sloane, N. J. A. (ed.). "Sequence A003998 (Numbers that are a sum of distinct positive cubes in more than one way)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  3. ↑ Sloane, N. J. A. (ed.). "Sequence A055393 (Sum of a square and a nonnegative cube in more than one way)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  4. ↑ Barry, Kieren (1999), The Greek Qabalah: Alphabetical Mysticism and Numerology in the Ancient World, Weiser Books, pp. 110–111, ISBN 9781609252274.
  5. ↑ "A229093 - OEIS". oeis.org. Retrieved 2026-06-15.
  6. ↑ (sequence A005893 in the OEIS)
  7. ↑ Sloane, N. J. A. (ed.). "Sequence A003107 (Number of partitions of n into Fibonacci parts (with a single type of 1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-25.
  8. ↑ Sloane, N. J. A. (ed.). "Sequence A174457 (Infinitely refactorable numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-10-16.
  9. ↑ "Richmond is getting a new area code. Not everyone is thrilled: 'I'll be 804 forever'". WTVR-TV. Retrieved 2025-03-16.
  10. ↑ Karri Peifer. "The 804 is running out of numbers". AXIOS Richmond. Retrieved 2025-03-16.
  11. ↑ Sloane, N. J. A. (ed.). "Sequence A002095 (Number of partitions of n into nonprime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-25.
  12. ↑ Sloane, N. J. A. (ed.). "Sequence A002088 (Sum of totient function: a(n) = Sum_{k=1..n} phi(k), cf. A000010)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-25.
  13. ↑ Sloane, N. J. A. (ed.). "Sequence A024816 (Antisigma(n): Sum of the numbers less than n that do not divide n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-25.
  14. 1 2 Sloane, N. J. A. (ed.). "Sequence A000787 (Strobogrammatic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  15. ↑ Sloane, N. J. A. (ed.). "Sequence A005384 (Sophie Germain primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  16. ↑ Sloane, N. J. A. (ed.). "Sequence A065577 (Number of Goldbach partitions of 10^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-08-31.
  17. ↑ 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)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-25.
  18. 1 2 Sloane, N. J. A. (ed.). "Sequence A002378 (Oblong (or promic, pronic, or heteromecic) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  19. ↑ 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.
  20. ↑ "A016105 - OEIS". oeis.org. Retrieved 2026-07-06.
  21. ↑ Sloane, N. J. A. (ed.). "Sequence A049312 (Number of graphs with a distinguished bipartite block, by number of vertices)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-25.
  22. ↑ Sloane, N. J. A. (ed.). "Sequence A000292 (Tetrahedral numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  23. ↑ Sloane, N. J. A. (ed.). "Sequence A000931 (Padovan sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  24. ↑ Sloane, N. J. A. (ed.). "Sequence A003215 (Hex (or centered hexagonal) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  25. ↑ Sloane, N. J. A. (ed.). "Sequence A000330 (Square pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  26. 1 2 Sloane, N. J. A. (ed.). "Sequence A000217 (Triangular numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  27. ↑ "A000124 - OEIS". oeis.org. Retrieved 2026-07-06.
  28. ↑ Sloane, N. J. A. (ed.). "Sequence A005282 (Mian-Chowla sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  29. 1 2 3 4 Sloane, N. J. A. (ed.). "Sequence A006753 (Smith numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  30. ↑ Sloane, N. J. A. (ed.). "Sequence A098859 (Number of partitions of n into parts each of which is used a different number of times)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-25.
  31. 1 2 Sloane, N. J. A. (ed.). "Sequence A016038 (Strictly non-palindromic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  32. ↑ (sequence A045943 in the OEIS)
  33. ↑ Sloane, N. J. A. (ed.). "Sequence A001401 (Number of partitions of n into at most 5 parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-25.
  34. ↑ (sequence A085449 in the OEIS)
  35. ↑ "A000567 - OEIS". oeis.org. Retrieved 2026-07-06.
  36. ↑ Sloane, N. J. A. (ed.). "Sequence A001845 (Centered octahedral numbers (crystal ball sequence for cubic lattice))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-06-02.
  37. ↑ Sloane, N. J. A. (ed.). "Sequence A001006 (Motzkin numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  38. ↑ Sloane, N. J. A. (ed.). "Sequence A085787 (Generalized heptagonal numbers: m*(5*m – 3)/2, m = 0, +-1, +-2 +-3, ...)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-30.
  39. ↑ Sloane, N. J. A. (ed.). "Sequence A027430 (Number of distinct products ijk with 1 <= i<j<k <= n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  40. 1 2 3 Sloane, N. J. A. (ed.). "Sequence A005385 (Safe primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  41. ↑ Sloane, N. J. A. (ed.). "Sequence A100827 (Highly cototient numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  42. ↑ Sloane, N. J. A. (ed.). "Sequence A001844 (Centered square numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  43. ↑ Sloane, N. J. A. (ed.). "Sequence A069099 (Centered heptagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  44. ↑ Sloane, N. J. A. (ed.). "Sequence A016754 (Odd squares: a(n) = (2n+1)^2. Also centered octagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  45. ↑ Sloane, N. J. A. (ed.). "Sequence A000014 (Number of series-reduced trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  46. ↑ 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 2022-05-24.
  47. ↑ Sloane, N. J. A. (ed.). "Sequence A000032 (Lucas numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  48. ↑ Sloane, N. J. A. (ed.). "Sequence A045882 (Smallest term of first run of (at least) n consecutive integers which are not squarefree)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-24.
  49. ↑ Sloane, N. J. A. (ed.). "Sequence A032527 (Concentric pentagonal numbers: floor( 5*n^2 / 4 ))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-24.
  50. ↑ Sloane, N. J. A. (ed.). "Sequence A182699 (Number of emergent parts in all partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-24.
  51. ↑ 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 2022-05-24.
  52. ↑ Sloane, N. J. A. (ed.). "Sequence A032020 (Number of compositions (ordered partitions) of n into distinct parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-24.
  53. ↑ Sloane, N. J. A. (ed.). "Sequence A000326 (Pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  54. ↑ Sloane, N. J. A. (ed.). "Sequence A001608 (Perrin sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  55. ↑ Sloane, N. J. A. (ed.). "Sequence A002995 (Number of unlabeled planar trees (also called plane trees) with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-24.
  56. ↑ Sloane, N. J. A. (ed.). "Sequence A001107 (10-gonal (or decagonal) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  57. ↑ Sloane, N. J. A. (ed.). "Sequence A005898 (Centered cube numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  58. ↑ Sloane, N. J. A. (ed.). "Sequence A001106 (9-gonal (or enneagonal or nonagonal) numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  59. ↑ Sloane, N. J. A. (ed.). "Sequence A005891 (Centered pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  60. ↑ Sloane, N. J. A. (ed.). "Sequence A007850 (Giuga numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  61. ↑ Sloane, N. J. A. (ed.). "Sequence A000219 (Number of planar partitions (or plane partitions) of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-24.
  62. ↑ Sloane, N. J. A. (ed.). "Sequence A019506 (Hoax numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-24.
  63. ↑ Sloane, N. J. A. (ed.). "Sequence A000384 (Hexagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  64. ↑ "A000124 - OEIS". oeis.org. Retrieved 2026-07-09.
  65. ↑ Sloane, N. J. A. (ed.). "Sequence A001606 (Indices of prime Lucas numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  66. ↑ Sloane, N. J. A. (ed.). "Sequence A006534". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-10.
  67. ↑ Sloane, N. J. A. (ed.). "Sequence A076281 (Number of 5-chromatic (i.e., chromatic number equals 5) simple graphs on n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-24.
  68. ↑ Sloane, N. J. A. (ed.). "Sequence A059376 (Jordan function J_3(n))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-24.
  69. ↑ Sloane, N. J. A. (ed.). "Sequence A036913 (Sparsely totient numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  70. ↑ Sloane, N. J. A. (ed.). "Sequence A014439 (Differences between two positive cubes in exactly 1 way.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2019-08-18.
  71. ↑ Sloane, N. J. A. (ed.). "Sequence A001318 (Generalized pentagonal numbers.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2019-08-26.
  72. ↑ Sloane, N. J. A. (ed.). "Sequence A000110 (Bell or exponential numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  73. ↑ Sloane, N. J. A. (ed.). "Sequence A101929 (Number of Pythagorean triples with hypotenuse < 10^n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-11.
  74. ↑ Sloane, N. J. A. (ed.). "Sequence A319190 (Number of regular hypergraphs)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2019-08-18.
  75. ↑ Sloane, N. J. A. (ed.). "Sequence A007661 (Triple factorial numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-11.
  76. ↑ "Sloane's A006052 : Number of magic squares of order n composed of the numbers from 1 to n^2, counted up to rotations and reflections". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-02.
  77. ↑ Sloane, N. J. A. (ed.). "Sequence A111808 (Left half of trinomial triangle (A027907), triangle read by rows)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-11.
  78. ↑ Sloane, N. J. A. (ed.). "Sequence A005893 (Number of points on surface of tetrahedron)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-11.
  79. ↑ 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)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-11.
  80. ↑ Sloane, N. J. A. (ed.). "Sequence A069484 (a(n) = prime(n+1)^2 + prime(n)^2.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-11.
  81. ↑ Sloane, N. J. A. (ed.). "Sequence A003261 (Woodall numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-11.
  82. ↑ Sloane, N. J. A. (ed.). "Sequence A037074 (Numbers that are the product of a pair of twin primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-11.
  83. ↑ 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 2022-05-11.