Edge Rewrite
// HTMLRewriter · presentation

This page was redesigned at the edge.

Cloudflare fetched the original article and streamed it through HTMLRewriter to apply an entirely new visual system without rebuilding the source page.

// request.cf · coarse context

A page that knows where it met you.

Only coarse request metadata is shown. This demo does not display or persist visitor IP addresses.

Country
US
Cloudflare location
CMH
Connection
HTTP/2
Language
Not provided

Ray ID: a273c06fca87c60e

Jump to content

// Workers AI · dad joke modeWhy was 700 a good number? It had a lot of magnitude.

From Wikipedia, the free encyclopedia
(Redirected from 770 (number))

699 700 701
Cardinalseven hundred
Ordinal700th
(seven hundredth)
Factorization22 × 52 × 7
Greek numeralΨ´
Roman numeralDCC, dcc
Binary10101111002
Ternary2212213
Senary31246
Octal12748
Duodecimal4A412
Hexadecimal2BC16
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

[edit]

700s

[edit]

701

[edit]

701 is a prime number, a Chen prime, an Eisenstein prime with no imaginary part, and the sum of three consecutive primes (229 + 233 + 239).

702

[edit]

702 = 2 × 33 × 13. It is a pronic number,[1] a nontotient, and a Harshad number.

703

[edit]

703 = 19 × 37. It is a hexagonal number,[2] a Kaprekar number[3] and the 37th triangular number.[4] It is the smallest number requiring 73 fifth powers for Waring representation.

703 is commonly found in the formula for body mass index.

704

[edit]

704 = 26 × 11. It is a Harshad number and a lazy caterer number.[5]

705

[edit]

705 = 3 × 5 × 47. It is a sphenic number the smallest Bruckman-Lucas pseudoprime.[6]

706

[edit]

706 = 2 × 353. It is a nontotient a Smith number.[7]

707

[edit]

707 = 7 × 101. It is a palindromic number and the sum of five consecutive primes (131 + 137 + 139 + 149 + 151). There are 707 lattice paths from (0,0) to (5,5) with steps (0,1), (1,0) and, when on the diagonal, (1,1).[8]

708

[edit]

708 = 22 × 3 × 59. There are 708 partitions of 28 that do not contain 1 as a part.[9]

709

[edit]

709 is a prime number and a happy number.

It is the seventh in the series 2, 3, 5, 11, 31, 127, 709 where each number is the nth prime with n being the number preceding it in the series, therefore, it is a prime index number.

710s

[edit]

710

[edit]

710 = 2 × 5 × 71. It is a sphenic number and a nontotient. There are 710 forests with 11 vertices.[10][11]

711

[edit]

711 = 32 × 79. It is a Harshad number. There are 711 planar Berge perfect graphs on 7 nodes.[12]

712

[edit]

712 = 23 × 89. It is a refactorable number, the totient sum for first 48 integers, and the sum of the first twenty-one primes.

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

[edit]

713 = 23 × 31. It is a Blum integer.

In Judaism there are 713 letters on a Mezuzah scroll.

714

[edit]

714 = 2 × 3 × 7 × 17. It is a nontotient and a balanced number, and the sum of twelve consecutive primes (37 + 41 + 43 + 47 + 53 + 59 + 61 + 67 + 71 + 73 + 79 + 83).[13] It forms a Ruth–Aaron pair with 715 (either definition). It is the sum of twelve consecutive primes (37 + 41 + 43 + 47 + 53 + 59 + 61 + 67 + 71 + 73 + 79 + 83).

The product of 714 and 715 is the product of the first 7 prime numbers (2, 3, 5, 7, 11, 13, and 17).

715

[edit]

715 = 5 × 11 × 13. It is a sphenic number, a pentagonal number,[14] and a Harshad number. It forms a Ruth-Aaron pair with 714 (either definition).

It is a pentatope number because 713=.[15]

The product of 714 and 715 is the product of the first 7 prime numbers (2, 3, 5, 7, 11, 13, and 17).

716

[edit]

716 = 22 × 179.

717

[edit]

717 = 3 × 239. It is a palindromic number.

718

[edit]

718 = 2 × 359.

719

[edit]

719 is a prime number, a Sophie Germain prime,[16] a safe prime,[17] a Chen prime, and an Eisenstein prime with no imaginary part.

Because 719 = 6! − 1, 719 is a factorial prime.[18]

It is the sum of seven consecutive primes (89 + 97 + 101 + 103 + 107 + 109 + 113).

720s

[edit]

720

[edit]

721

[edit]

721 = 7 × 103. It is a centered hexagonal number[19] and the sum of nine consecutive primes (61 + 67 + 71 + 73 + 79 + 83 + 89 + 97 + 101). It is the smallest number that is the difference of two positive cubes in two ways.

722

[edit]

722 = 2 × 192. It is a nontotient. There are 722 odd parts in all partitions of 15.[20]

723

[edit]

723 = 3 × 241. It is the side length of an almost-equilateral Heronian triangle.[21]

724

[edit]

724 = 22 × 181. It is a nontotient and the side length of an almost-equilateral Heronian triangle.[22] It is the sum of four consecutive primes (173 + 179 + 181 + 191) and the sum of six consecutive primes (107 + 109 + 113 + 127 + 131 + 137). There are 724 n-queens problem solutions for n = 10.

725

[edit]

725 = 52 × 29. It is the side length of an almost-equilateral Heronian triangle.[23]

726

[edit]

726 = 2 × 3 × 112. It is a pentagonal pyramidal number.[24]

727

[edit]

727 is a prime number, a palindromic prime, and a lucky prime.[25]

728

[edit]

728 = 23 × 7 × 13. It is a nontotient, a Smith number,[7] and a cabtaxi number.[26] There are 728 cubes of edge length 1 required to make a hollow cube of edge length 12.There are 728 connected graphs on 5 labelled vertices.

728!! - 1 is prime.[27]

72864 + 1 is prime.

729

[edit]

729 = 272 = 93 = 36. It is a perfect totient number,[28] a Smith number,[7] and a centered octagonal number.[29] It is the largest three-digit cube (93) and the only three-digit sixth power (36).

A philosopher king's pleasure is 729 times a tyrant's pleasure according to Plato in the Republic.

730s

[edit]

730

[edit]

730 = 2 × 5 × 73. It is a sphenic number, a nontotient, and a Harshad number. There are 730 generalized weak orders on 5 points.[30]

731

[edit]

731 = 17 × 43. It is the sum of three consecutive primes (239 + 241 + 251). There are 731 Euler trees with total weight 7.[31]

732

[edit]

732 = 22 × 3 × 61. It is a Harshad number.

It is the sum of eight consecutive primes (73 + 79 + 83 + 89 + 97 + 101 + 103 + 107) and the sum of ten consecutive primes (53 + 59 + 61 + 67 + 71 + 73 + 79 + 83 + 89 + 97).

There are 732 collections of subsets of {1, 2, 3, 4} that are closed under union and intersection.[32]

733

[edit]

733 is a prime number, a balanced prime,[33] a permutable prime, and an emirp. It is the sum of five consecutive primes (137 + 139 + 149 + 151 + 157)

734

[edit]

734 = 2 × 367. It is a nontotient. There are 734 traceable graphs on 7 nodes.[34]

735

[edit]

735 = 3 × 5 × 72. It is a Harshad number and a Zuckerman number.

  • the smallest number such that uses the same digits as its distinct prime factors

736

[edit]

736 = 25 × 23. It is a centered heptagonal number,[35] a happy number, a Harshad number, and a nice Friedman number since 736 = 7 + 36.

737

[edit]

737 = 11 × 67. It is a palindromic number and a blum integer.

738

[edit]

738 = 2 × 32 × 41. It is a Harshad number.

739

[edit]

739 is a prime number, a lucky prime,[25] a prime index prime, a happy number, and a strictly non-palindromic number.[36]

740s

[edit]

740

[edit]

740 = 22 × 5 × 37. It is a nontotient. There are 740 connected square free graphs on 9 nodes.[37]

741

[edit]

741 = 3 × 13 × 19. It is a sphenic number and the 38th triangular number.[4]

742

[edit]

742 = 2 × 7 × 53. It is a sphenic number, a decagonal number,[38] an icosahedral number, and a lazy caterer number.[39] There are 742 partitions of 30 into divisors of 30.[40]

  • the smallest number that is one more than triple its reverse.

743

[edit]

It is a prime number and an eisenstein prime with no imaginary part. 743 is a Sophie Germain prime because 2 × 743 + 1 = 1487 and 1487 is also prime. 743 is an emirp, because 347 (the reversal of its digits) is prime.

There are exactly 743 independent sets in a four-dimensional (16 vertex) hypercube graph, and exactly 743 connected cubic graphs with 16 vertices and girth four.

744

[edit]

744 is a semiperfect number[41] and an abundant number.[42][43]

The j-invariant, an important function in the study of modular forms and Monstrous moonshine, can be written as a Fourier series in which the constant term is 744:[44] where . One consequence of this is that 744 appears in expressions for Ramanujan's constant and other almost integers.

745

[edit]

745 = 5 × 149. There are 745 non-connected simple labeled graphs covering 6 vertices.[45]

746

[edit]

746 = 2 × 373.

It is a nontotient. There are 746 non-normal semi-magic squares with sum of entries equal to 6.[46]

746=15 + 24 + 36 = 17 + 24 + 36.

747

[edit]

747 = 32 × 83. It is a palindromic number.

747=[47]

748
[edit]

748 = 22 × 11 × 17. It is a nontotient, a happy number, and a primitive abundant number.[48]

749

[edit]

749 = 7 × 107. It is a blum integer and the sum of three consecutive primes (241 + 251 + 257).

750s

[edit]

750

[edit]

750 = 2 × 3 × 53. It is an enneagonal number.[49]

751

[edit]

751 is a prime number, a Chen prime, and an emirp.

752

[edit]

752 = 24 × 47. It is a nontotient. There are 752 partitions of 11 into parts of 2 kinds[50]

753

[edit]

753 = 3 × 251. It is a blum integer.

754

[edit]

754 = 2 × 13 × 29. It is a sphenic number, a nontotient, and the totient sum for first 49 integers.

There are 754 different ways to divide a 10 × 10 square into sub-squares.[51]

755

[edit]

755 = 5 × 151. There are 755 vertices in a regular drawing of the complete bipartite graph K9,9.[52]

756

[edit]

756 = 22 × 33 × 7. It is a pronic number,[1] a Harshad number, and the sum of six consecutive primes (109 + 113 + 127 + 131 + 137 + 139).

757

[edit]

757 is a prime number, a palindromic prime, a happy number, and the sum of seven consecutive primes (97 + 101 + 103 + 107 + 109 + 113 + 127).

758

[edit]

758 = 2 × 379.

It is a nontotient and a prime number of measurement.[53]

759

[edit]

759 = 3 × 11 × 23.

It is a sphenic number, a q-Fibonacci number for q=3,[54] and the sum of five consecutive primes (139 + 149 + 151 + 157 + 163).

760s

[edit]

760

[edit]

760 = 23 × 5 × 19.

It is a centered triangular number.[55] There are 760 fixed heptominoes.

761

[edit]

761 is a prime number, an emirp, a Sophie Germain prime,[16] a Chen prime, an Eisenstein prime with no imaginary part, and a centered square number.[56]

762

[edit]

762 = 2 × 3 × 127. It is a sphenic number, a nontotient, a Smith number,[7] an admirable number, and the sum of four consecutive primes (181 + 191 + 193 + 197).

There are 762 1's in all partitions of 25 into odd parts[57] There are Six nines in the decimal representation of pi after the 762nd digit.

763

[edit]

763 = 7 × 109.

It is the sum of nine consecutive primes (67 + 71 + 73 + 79 + 83 + 89 + 97 + 101 + 103). There are 763 degree-8 permutations of order exactly 2.[58]

764

[edit]

764 = 22 × 191. It is a telephone number.[59]

765

[edit]

765=32 × 5 × 17.

It is an octagonal pyramidal number.[60]

It is a Japanese word-play for Namco.

766

[edit]

766 = 2 × 383. It is a centered pentagonal number,[61] a nontotient, and the sum of twelve consecutive primes (41 + 43 + 47 + 53 + 59 + 61 + 67 + 71 + 73 + 79 + 83 + 89).

767

[edit]

767 = 13 × 59. It is a palindromic number and a Thabit number because 767 = 28 × 3 − 1

768

[edit]

768 = 28 × 3.[62] It is the sum of eight consecutive primes (79 + 83 + 89 + 97 + 101 + 103 + 107 + 109).

769

[edit]

769 is a prime number, a Chen prime, a lucky prime,[25] and a Proth prime.[63]

770s

[edit]

770

[edit]

770 = 2 × 5 × 7 × 11. It is a nontotient and a Harshad number.

is prime[64]

It holds special importance in the Chabad-Lubavitch Hasidic movement.

771

[edit]

771 = 3 × 257.

It is sum of three consecutive primes in arithmetic progression (251 + 257 + 263). Since 771 is the product of the distinct Fermat primes 3 and 257, a regular polygon with 771 sides can be constructed using compass and straightedge, and can be written in terms of square roots.

772

[edit]

772 = 22 × 193.

772!!!!!!+1 is prime.[65]

773

[edit]

773 is a prime number, an Eisenstein prime with no imaginary part, a prime index prime, and a tetranacci number.[66]

  • the sum of the number of cells that make up the convex, regular 4-polytopes

774

[edit]

774 = 2 × 32 × 43. It is a nontotient, a Harshad number, and the totient sum for first 50 integers

775

[edit]

775 = 52 × 31. It is a member of the Mian–Chowla sequence[67]

776

[edit]

776 = 23 × 97.

It is a refactorable number. There are 776 compositions of 6 whose parts equal to q can be of q2 kinds.[68]

777

[edit]

778

[edit]

778 = 2 × 389. It is a nontotient and a Smith number.[7]

779

[edit]

779 = 19 × 41. It is a highly cototient number.[69]

780s

[edit]

780

[edit]

780 = 22 × 3 × 5 × 13. It is a hexagonal number,[2] a Harshad number, and the 39th triangular number.[4] It is the sum of four consecutive primes in a quadruplet (191, 193, 197, and 199) and the sum of ten consecutive primes (59 + 61 + 67 + 71 + 73 + 79 + 83 + 89 + 97 + 101).

780 and 990 are the fourth smallest pair of triangular numbers whose sum and difference (1770 and 210) are also triangular.

781

[edit]

781 = 11 × 71. It is a zero of the Mertens function and a lazy caterer number (sequence A000124 in the OEIS) It is the sum of powers of 5, or equivalently, repdigit in base 5 (11111)

782

[edit]

782 = 2 × 17 × 23. It is a sphenic number, a nontotient, a pentagonal number,[14] and a Harshad number.

783

[edit]

783 = 33 × 29. It is a heptagonal number.

784

[edit]

784 = 24 × 72. It is a happy number.

Since 784=282, 784 is a perfect square. It is the sum of the cubes of the first seven positive integers; .

785

[edit]

785 = 5 × 157. It is a zero of the Mertens function. There are 785 series-reduced planted trees with 6 leaves of 2 colors.[70]

786

[edit]

787

[edit]

787 is a prime number, a Chen prime, a lucky prime,[25] a palindromic prime, and the sum of five consecutive primes (149 + 151 + 157 + 163 + 167).

788

[edit]

788 = 22 × 197.

It is a nontotient. There are 788 compositions of 12 into parts with distinct multiplicities.[71]

789

[edit]

789 = 3 × 263. It is a Blum integer and the sum of three consecutive primes (257 + 263 + 269).

790s

[edit]

790

[edit]

790 = 2 × 5 × 79. It is a sphenic number, a nontotient, an aspiring number,[72] and the aliquot sum of 1574. It is a Harshad number in bases 2, 7, 14, and 16.

791

[edit]

791 = 7 × 113. It is a centered tetrahedral number, the sum of the first twenty-two primes, and the sum of seven consecutive primes (101 + 103 + 107 + 109 + 113 + 127 + 131).

792

[edit]

792 = 23 × 32 × 11. It is a Harshad number.

There are 792 integer partitions of 21.[73]

792=, a binomial coefficient.

793

[edit]

793 = 13 × 61. It is a zero of the Mertens function, a star number,[74] and a happy number.

794

[edit]

794 = 2 × 397. [75] It is a nontotient.

794= 16 + 26 + 36.

795

[edit]

795 = 3 × 5 × 53. It is a sphenic number and a zero of the Mertens function.

There are 795 permutations of length 7 with 2 consecutive ascending pairs.[76]

796

[edit]

796 = 22 × 199. It is a zero of the Mertens function and the sum of six consecutive primes (113 + 127 + 131 + 137 + 139 + 149).

797

[edit]

797 is a prime number, a Chen prime, an Eisenstein prime with no imaginary part, a palindromic prime, a two-sided prime, and a prime index prime.

798

[edit]

798 = 2 × 3 × 7 × 19. It is a zero of the Mertens function and a nontotient.

  • the product of primes indexed by the prime exponents of 10! [77]

799

[edit]

799 = 17 × 47. It is the smallest number with digit sum 25 [78]

References

[edit]
  1. 1 2 "Sloane's A002378 : Oblong (or promic, pronic, or heteromecic) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  2. 1 2 "Sloane's A000384 : Hexagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  3. "Sloane's A006886 : Kaprekar numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  4. 1 2 3 "Sloane's A000217 : Triangular numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  5. "A000124 - OEIS". oeis.org. Retrieved 4 July 2026.
  6. "A005845 - OEIS". oeis.org. Retrieved 4 July 2026.
  7. 1 2 3 4 5 "Sloane's A006753 : Smith numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  8. Sloane, N. J. A. (ed.). "Sequence A026671 (Number of lattice paths from (0,0) to (n,n) with steps (0,1), (1,0) and, when on the diagonal, (1,1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 22 May 2022.
  9. Sloane, N. J. A. (ed.). "Sequence A002865 (Number of partitions of n that do not contain 1 as a part)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2 June 2022.
  10. Hougardy, Stefan (October 2006). "Classes of perfect graphs". Discrete Mathematics. 306 (19–20): 2529–2571. doi:10.1016/j.disc.2006.05.021.
  11. Sloane, N. J. A. (ed.). "Sequence A005195 (Number of forests with n unlabeled nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 22 May 2022.
  12. Sloane, N. J. A. (ed.). "Sequence A123449 (Number of planar Berge perfect graphs on n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  13. 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.
  14. 1 2 "Sloane's A000326 : Pentagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  15. "Sloane's A000332 : Binomial coefficient binomial(n,4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  16. 1 2 "Sloane's A005384 : Sophie Germain primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  17. "Sloane's A005385 : Safe primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  18. "Sloane's A088054 : Factorial primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  19. "Sloane's A003215 : Hex (or centered hexagonal) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  20. Sloane, N. J. A. (ed.). "Sequence A066897 (Total number of odd parts in all partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 22 May 2022.
  21. Sloane, N. J. A. (ed.). "Sequence A016064 (Smallest side lengths of almost-equilateral Heronian triangles)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 22 May 2022.
  22. Sloane, N. J. A. (ed.). "Sequence A003500 (a(n) = 4*a(n-1) - a(n-2) with a(0) = 2, a(1) = 4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 22 May 2022.
  23. Sloane, N. J. A. (ed.). "Sequence A335025 (Largest side lengths of almost-equilateral Heronian triangles)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 22 May 2022.
  24. "Sloane's A002411 : Pentagonal pyramidal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  25. 1 2 3 4 "Sloane's A031157 : Numbers that are both lucky and prime". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  26. "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.
  27. Sloane, N. J. A. (ed.). "Sequence A007749 (Numbers k such that k!! - 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 24 May 2022.
  28. "Sloane's A082897 : Perfect totient numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  29. "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.
  30. Sloane, N. J. A. (ed.). "Sequence A004123 (Number of generalized weak orders on n points)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 22 May 2022.
  31. Sloane, N. J. A. (ed.). "Sequence A007317 (Binomial transform of Catalan numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  32. Sloane, N. J. A. (ed.). "Sequence A306445 (Number of collections of subsets of {1, 2, ..., n} that are closed under union and intersection)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 22 May 2022.
  33. "Sloane's A006562 : Balanced primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  34. Sloane, N. J. A. (ed.). "Sequence A057864 (Number of simple traceable graphs on n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 22 May 2022.
  35. "Sloane's A069099 : Centered heptagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  36. "Sloane's A016038 : Strictly non-palindromic numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  37. Sloane, N. J. A. (ed.). "Sequence A077269 (Number of connected squarefree graphs on n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 23 May 2022.
  38. "Sloane's A001107 : 10-gonal (or decagonal) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  39. "A000124 - OEIS". oeis.org. Retrieved 5 July 2026.
  40. Sloane, N. J. A. (ed.). "Sequence A018818 (Number of partitions of n into divisors of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  41. Sloane, N. J. A. (ed.). "Sequence A005835 (Pseudoperfect (or semiperfect) numbers n: some subset of the proper divisors of n sums to n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 3 April 2023.
  42. Sloane, N. J. A. (ed.). "Sequence A005101 (Abundant numbers (sum of divisors of m exceeds 2m).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 3 April 2023.
  43. Sloane, N. J. A. (ed.). "Sequence A033880 (Abundance of n, or (sum of divisors of n) - 2n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 29 December 2023.
  44. Berndt, Bruce C.; Chan, Heng Huat (1999). "Ramanujan and the modular j-invariant". Canadian Mathematical Bulletin. 42 (4): 427–440. doi:10.4153/CMB-1999-050-1. MR 1727340. S2CID 1816362.
  45. Sloane, N. J. A. (ed.). "Sequence A327070 (Number of non-connected simple labeled graphs covering n vertices)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 23 May 2022.
  46. Sloane, N. J. A. (ed.). "Sequence A321719 (Number of non-normal semi-magic squares with sum of entries equal to n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 30 May 2022.
  47. Sloane, N. J. A. (ed.). "Sequence A064628 (Floor(4^n / 3^n))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 30 May 2022.
  48. "Sloane's A091191 : Primitive abundant numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  49. "Sloane's A001106 : 9-gonal (or enneagonal or nonagonal) numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  50. Sloane, N. J. A. (ed.). "Sequence A000712 (Generating function = Product_{m≥1} 1/(1 - x^m)^2; a(n) = number of partitions of n into parts of 2 kinds)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 30 May 2022.
  51. Sloane, N. J. A. (ed.). "Sequence A034295 (Number of different ways to divide an n X n square into sub-squares)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 23 May 2022.
  52. Sloane, N. J. A. (ed.). "Sequence A331755 (Number of vertices in a regular drawing of the complete bipartite graph K_{n,n})". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 23 May 2022.
  53. Sloane, N. J. A. (ed.). "Sequence A002049 (Prime numbers of measurement)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 23 May 2022.
  54. Sloane, N. J. A. (ed.). "Sequence A015474 (q-Fibonacci numbers for q=3)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 23 May 2022.
  55. "Sloane's A005448 : Centered triangular numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  56. "Sloane's A001844 : Centered square numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  57. Sloane, N. J. A. (ed.). "Sequence A036469 (Partial sums of A000009 (partitions into distinct parts))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  58. Sloane, N. J. A. (ed.). "Sequence A001189 (Number of degree-n permutations of order exactly 2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 23 May 2022.
  59. "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.
  60. Sloane, N. J. A. (ed.). "Sequence A002414 (Octagonal pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 23 May 2022.
  61. "Sloane's A005891 : Centered pentagonal numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  62. Sloane, N. J. A. (ed.). "Sequence A007283 (a(n) = 3*2^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 30 May 2022.
  63. "Sloane's A080076 : Proth primes". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  64. Sloane, N. J. A. (ed.). "Sequence A162862 (Numbers n such that n^10 + n^9 + n^8 + n^7 + n^6 + n^5 + n^4 + n^3 + n^2 + n + 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 30 May 2022.
  65. Sloane, N. J. A. (ed.). "Sequence A085150 (Numbers n such that n!!!!!!+1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 30 May 2022.
  66. "Sloane's A000078 : Tetranacci numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  67. "Sloane's A005282 : Mian-Chowla sequence". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  68. (sequence A033453 in the OEIS)
  69. "Sloane's A100827 : Highly cototient numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 11 June 2016.
  70. Sloane, N. J. A. (ed.). "Sequence A050381 (Number of series-reduced planted trees with n leaves of 2 colors)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 24 May 2022.
  71. Sloane, N. J. A. (ed.). "Sequence A242882 (Number of compositions of n into parts with distinct multiplicities)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 24 May 2022.
  72. Sloane, N. J. A. (ed.). "Sequence A063769 (Aspiring numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  73. Sloane, N. J. A. (ed.). "Sequence A000041 (a(n) = number of partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  74. Sloane, N. J. A. (ed.). "Sequence A003154 (Centered 12-gonal numbers. Also star numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  75. Sloane, N. J. A. (ed.). "Sequence A001550 (a(n) = 1^n + 2^n + 3^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  76. Sloane, N. J. A. (ed.). "Sequence A000274 (Number of permutations of length n with 2 consecutive ascending pairs)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 24 May 2022.
  77. Sloane, N. J. A. (ed.). "Sequence A325508 (Product of primes indexed by the prime exponents of n!)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 24 May 2022.
  78. Sloane, N. J. A. (ed.). "Sequence A051885 (Smallest number whose sum of digits is n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 24 May 2022.