Jump to content

744 (number): Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
move higher for a more natural flow of information
Line 79: Line 79:
The number of [[Eulerian path#Definition|Euler tours]] (or Eulerian cycles) of the [[Complete graph|complete]], ''undirected'' graph <math>K_{6}</math> on six [[Vertex (graph theory)|vertices]] and fifteen [[Edge (geometry)|edges]] is 744.<ref>{{Cite OEIS |A350028 |Number of Euler tours of the complete graph on n vertices (minus a matching if n is even). |access-date=2023-07-16 }}</ref>
The number of [[Eulerian path#Definition|Euler tours]] (or Eulerian cycles) of the [[Complete graph|complete]], ''undirected'' graph <math>K_{6}</math> on six [[Vertex (graph theory)|vertices]] and fifteen [[Edge (geometry)|edges]] is 744.<ref>{{Cite OEIS |A350028 |Number of Euler tours of the complete graph on n vertices (minus a matching if n is even). |access-date=2023-07-16 }}</ref>


== Riemann zeta function ==
== In the Riemann zeta function ==
The sequence of self-convoluted Fibonacci numbers starts {0, 0, 1, 2, 5, 10, 20, 38, 71, 130, 235, 420, 744, 1308, 2285, 3970, 6865, 11822...}.<ref name="ConvFib" /> The sum of the first seven terms (from the zeroth through the sixth term) is equal to 38, which is equivalent to the {{math|1=a(n) = 7}} member in this sequence. Taking the sum of the three terms that lie between 71 and 744 (i.e. 130, 235, 420) yields {{math|1=785 = [[28 (number)|28]]<sup>2</sup> + 1 }}, whose [[aliquot sum]] is 163,<ref name="AliSum" /> the thirty-eighth prime number.<ref name="PNum" /> [[785 (number)|785]] is the 60th number to return {{math|1=0 }} for the [[Mertens function]], which also includes 163, the 13th such number.<ref name="Mert0" /> 785 is also the number of [[Tree (graph theory)|irreducible]] [[Tree (graph theory)#Rooted tree|planted trees]] (of root vertex having degree one) with six [[Tree (graph theory)#Tree|leaves]] of two [[Graph coloring|colors]].<ref>{{Cite OEIS |A050381 |Number of series-reduced planted trees with n leaves of 2 colors. |access-date=2023-09-02 }}</ref>
The sequence of self-convoluted Fibonacci numbers starts {0, 0, 1, 2, 5, 10, 20, 38, 71, 130, 235, 420, 744, 1308, 2285, 3970, 6865, 11822...}.<ref name="ConvFib" /> The sum of the first seven terms (from the zeroth through the sixth term) is equal to 38, which is equivalent to the {{math|1=a(n) = 7}} member in this sequence. Taking the sum of the three terms that lie between 71 and 744 (i.e. 130, 235, 420) yields {{math|1=785 = [[28 (number)|28]]<sup>2</sup> + 1 }}, whose [[aliquot sum]] is 163,<ref name="AliSum" /> the thirty-eighth prime number.<ref name="PNum" /> [[785 (number)|785]] is the 60th number to return {{math|1=0 }} for the [[Mertens function]], which also includes 163, the 13th such number.<ref name="Mert0" /> 785 is also the number of [[Tree (graph theory)|irreducible]] [[Tree (graph theory)#Rooted tree|planted trees]] (of root vertex having degree one) with six [[Tree (graph theory)#Tree|leaves]] of two [[Graph coloring|colors]].<ref>{{Cite OEIS |A050381 |Number of series-reduced planted trees with n leaves of 2 colors. |access-date=2023-09-02 }}</ref>


1106, the first member in the sum of consecutive composite numbers (in equivalence with {{math|1=2229 = 743 × 3 }}) that are divisible by the twenty-fifth prime number 97,<ref name="CompGDivP">{{Cite OEIS |A074127 |Group the composite numbers so that the sum of the n-th group is a multiple of the n-th prime: (4), (6), (8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22), (24, 25), (26, 27, 28, 30, 32), (33, 34, ...), ... Sequence gives the group sum divided by n-th prime for the n-th group. |access-date=2024-01-20 }}</ref> is the smallest number to return a value of 14 in the inverse [[Mertens function]],<ref name="InvMert">{{Cite OEIS |A051402 |Inverse Mertens function: smallest k such that <nowiki>|</nowiki>M(k)<nowiki>|</nowiki> is equal to n, where M(x) is Mertens's function A002321. |access-date=2024-01-22 }}</ref> where 1106 lies between the 81st pair of [[sexy prime]]s {{math|1=(1103, 1109) }}.<ref name="LessSP">{{Cite OEIS |A023201 |Primes p such that p + 6 is also prime (Lesser of a pair of sexy primes.) |access-date=2024-01-06 }}</ref> 14 is the [[Floor and ceiling functions|floor]] (and [[Almost integer|nearest integer]])<ref>{{Cite OEIS |A002410 |Nearest integer to imaginary part of n-th zero of Riemann zeta function. |access-date=2024-01-16 }}</ref> of the [[imaginary number|imaginary part]] of the first non-trivial zero in the [[Riemann zeta function]] {{math|1=ζ }}, and the fourteenth indexed floor value is [[60 (number)|60]]<ref>{{Cite OEIS |A013629 |Floor of imaginary parts of nontrivial zeros of Riemann zeta function. |access-date=2024-02-07 }}</ref><ref>{{Cite web |last=Odlyzko |first=Andrew |author-link=Andrew Odlyzko |title=The first 100 (non trivial) zeros of the Riemann Zeta function [AT&T Labs]|url=https://www-users.cse.umn.edu/~odlyzko/zeta_tables/zeros2 |website=Andrew Odlyzko: Home Page |publisher=[[University of Minnesota College of Science and Engineering|UMN CSE]] |access-date=2024-01-16 }}</ref> — sixty is the smallest number with exactly ''twelve'' divisors, and there are only two numbers which have a [[Divisor function|sum-of-divisors]] of 60: [[24 (number)|24]] and [[38 (number)|38]],<ref name="SigmaSoD" /> whose sum is 62 (which is the tenth largest divisor of 744); also, three of nine numbers with totients of 60 are also divisors of 744 (93, 124, and 186, that add to 403).<ref name="Etot" /> On the other hand, the difference {{math|1=38 − 24 = 14 }}, where the sixtieth floor value in the imaginary part of its nontrivial zero in {{math|1=ζ }} is the largest [[Heegner number]] 163.
1106, the first member in the sum of consecutive composite numbers (in equivalence with {{math|1=2229 = 743 × 3 }}) that are divisible by the twenty-fifth prime number 97,<ref name="CompGDivP">{{Cite OEIS |A074127 |Group the composite numbers so that the sum of the n-th group is a multiple of the n-th prime: (4), (6), (8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22), (24, 25), (26, 27, 28, 30, 32), (33, 34, ...), ... Sequence gives the group sum divided by n-th prime for the n-th group. |access-date=2024-01-20 }}</ref> is the smallest number to return a value of 14 in the inverse [[Mertens function]],<ref name="InvMert">{{Cite OEIS |A051402 |Inverse Mertens function: smallest k such that <nowiki>|</nowiki>M(k)<nowiki>|</nowiki> is equal to n, where M(x) is Mertens's function A002321. |access-date=2024-01-22 }}</ref> where 1106 lies between the 81st pair of [[sexy prime]]s {{math|1=(1103, 1109) }}.<ref name="LessSP">{{Cite OEIS |A023201 |Primes p such that p + 6 is also prime (Lesser of a pair of sexy primes.) |access-date=2024-01-06 }}</ref> 14 is the [[Floor and ceiling functions|floor]] (and [[Almost integer|nearest integer]])<ref>{{Cite OEIS |A002410 |Nearest integer to imaginary part of n-th zero of Riemann zeta function. |access-date=2024-01-16 }}</ref> of the [[imaginary number|imaginary part]] of the first non-trivial zero in the [[Riemann zeta function]] {{math|1=ζ }}, and the fourteenth indexed floor value is [[60 (number)|60]]<ref>{{Cite OEIS |A013629 |Floor of imaginary parts of nontrivial zeros of Riemann zeta function. |access-date=2024-02-07 }}</ref><ref>{{Cite web |last=Odlyzko |first=Andrew |author-link=Andrew Odlyzko |title=The first 100 (non trivial) zeros of the Riemann Zeta function [AT&T Labs]|url=https://www-users.cse.umn.edu/~odlyzko/zeta_tables/zeros2 |website=Andrew Odlyzko: Home Page |publisher=[[University of Minnesota College of Science and Engineering|UMN CSE]] |access-date=2024-01-16 }}</ref> — sixty is the smallest number with exactly ''twelve'' divisors, and there are only two numbers which have a [[Divisor function|sum-of-divisors]] of 60: [[24 (number)|24]] and [[38 (number)|38]],<ref name="SigmaSoD" /> whose sum is 62 (which is the tenth largest divisor of 744); also, three of nine numbers with totients of 60 are also divisors of 744 (93, 124, and 186, that add to 403).<ref name="Etot" /> On the other hand, the difference {{math|1=38 − 24 = 14 }}, where the sixtieth floor value in the imaginary part of its nontrivial zero in {{math|1=ζ }} is the largest [[Heegner number]] 163.


=== In relation to Robin's theorem ===
=== Relation to Robin's theorem ===


The twentieth prime number is [[71 (number)|71]], where 31 is the eleventh; in turn, [[20 (number)|20]] is the eleventh ''composite number''<ref name="CompNum" /> that is also the sixth self-convolution of Fibonacci numbers before 38, which is the prime index of 163. 71 is also part of the largest pair of [[Brocard's problem#Brown numbers|Brown numbers]] {{math|1=(71, 7) }}, of only three such pairs; where in its case {{math|1=7<sup>2</sup> − 1 = 5040 }}.<ref>{{Cite OEIS |A216071 |Brocard's problem: positive integers m such that m^2 equal to n! + 1 for some n. |access-date=2023-10-10 }}</ref><ref>{{Cite OEIS |A085692 |Brocard's problem: squares which can be written as n!+1 for some n. |access-date=2023-10-10 }}</ref> Consequently, both 5040 and 5041 can be represented as sums of non-consecutive [[factorial]]s, following 746, 745, and 744;<ref name="N-CF" /> where {{math|1=5040 + 5041 = 10081}} holds an aliquot sum of [[611 (number)|611]], which is the ''composite index'' of 744.<ref name="CompNum" />
The twentieth prime number is [[71 (number)|71]], where 31 is the eleventh; in turn, [[20 (number)|20]] is the eleventh ''composite number''<ref name="CompNum" /> that is also the sixth self-convolution of Fibonacci numbers before 38, which is the prime index of 163. 71 is also part of the largest pair of [[Brocard's problem#Brown numbers|Brown numbers]] {{math|1=(71, 7) }}, of only three such pairs; where in its case {{math|1=7<sup>2</sup> − 1 = 5040 }}.<ref>{{Cite OEIS |A216071 |Brocard's problem: positive integers m such that m^2 equal to n! + 1 for some n. |access-date=2023-10-10 }}</ref><ref>{{Cite OEIS |A085692 |Brocard's problem: squares which can be written as n!+1 for some n. |access-date=2023-10-10 }}</ref> Consequently, both 5040 and 5041 can be represented as sums of non-consecutive [[factorial]]s, following 746, 745, and 744;<ref name="N-CF" /> where {{math|1=5040 + 5041 = 10081}} holds an aliquot sum of [[611 (number)|611]], which is the ''composite index'' of 744.<ref name="CompNum" />

Revision as of 21:58, 8 August 2024

← 743 744 745 →
Cardinalseven hundred forty-four
Ordinal744th
(seven hundred forty-fourth)
Factorization23 × 3 × 31
Divisors1, 2, 3, 4, 6, 8, 12, 24, 31, 62, 93, 124, 186, 248, 372, 744
Greek numeralΨΜΔ´
Roman numeralDCCXLIV
Binary10111010002
Ternary10001203
Senary32406
Octal13508
Duodecimal52012
Hexadecimal2E816

744 (seven hundred [and] forty four) is the natural number following 743 and preceding 745.

744 plays a major role within moonshine theory of sporadic groups, in context of the classification of finite simple groups.

Number theory

744 is the nineteenth number of the form where , and represent distinct prime numbers (2, 3, and 31; respectively).[1]

It can be represented as the sum of nonconsecutive factorials ,[2] as the sum of four consecutive primes ,[3] and as the product of sums of divisors of consecutive integers ;[4] respectively:

744 contains sixteen total divisors — fourteen aside from its largest and smallest unitary divisors — all of which collectively generate an integer arithmetic mean of [5][6] that is also the first number of the form [1] 120 is also equal to the sum of the first fifteen integers, or fifteenth triangular number Σ15
n = 1
n
,[7] while it is also the smallest number with sixteen divisors,[8] with 744 the thirty-first such number.[9] This value is also equal to the sum of all the prime numbers less than 31 that are not factors of 744 except for 5, and including 1. Inclusive of 5, this sum is equal to 125 = 53, which is the second number after 32 to have an aliquot sum of 31.[10] In the Collatz conjecture, 744 and 120 both require fifteen steps to reach 5, before cycling through {16, 8, 4, 2, 1} in five steps.[11][12] Otherwise, they both require nineteen steps to reach 2, which is the middle node in the {1,4,2,1,4...} elementary trajectory for 1 when cycling back to itself, or twenty steps to reach 1.

The number partitions of the square of seven (49) into prime parts is 744,[13] as is the number of partitions of 48 into at most four distinct parts.[14] The radical 186 = 2 × 3 × 31 of 744[15] has an arithmetic mean of divisors equal to 48,[6] where the sum between the three distinct prime factors of 744 is 62 = 36. 744 is also a practical number,[16] and the first number to be the sum of nine cubes in eight or more ways,[17] as well as the number of six-digit perfect powers in decimal.[18]

φ(n) and σ(n)

744 has two hundred and forty integers that are relatively prime or coprime with and up to itself, equivalently its Euler totient . 744 is the twenty-third of thirty-one such numbers to have a totient of 240, after 738, and preceding 770. The smallest is 241, the fifty-third prime number and sixteenth super-prime,[19] and the largest is 1050, which represents the number of parts in all partitions of 29 into distinct parts.[20]

This totient of 744 is regular like its sum-of-divisors , where 744 sets the twenty-ninth record for of 1920.[21] The value of this sigma function represents the fifteenth sum of non-triangular numbers in-between triangular numbers; in this instance it is the sum that lies in-between the fifteenth (120) and sixteenth (136) triangular numbers[22] (i.e. the sum of 121 + 122 + ... + 135). Both the totient and sum-of-divisors values of 744 contain the same set of distinct prime factors (2, 3, and 5),[23] while the Carmichael function or reduced totient (which counts the least common multiple of order of elements in a multiplicative group of integers modulo ) at seven hundred forty-four is equal to .[24]

Totatives

Of these 240 totatives, 110 are strictly composite totatives that nearly match the sequence of composite numbers up to 744 that are congruent to , which is the same congruence that all prime numbers greater than 3 hold.[25] Only seven numbers present in this sequence are not totatives of 744 (less-than); they are 713, 589, 527, 403, 341, 217, and 155; all of which are divisible by the eleventh prime number 31. The remaining 130 totatives are 1 and all the primes between 5 and 743 except for 31 (all prime numbers less than 744 that are not part of its prime factorization) where its largest prime totative of 743 has a prime index of 132 (the smallest digit-reassembly number in decimal).[26] On the other hand, only three numbers hold a totient of 744; they are 1119, 1492, and 2238.[27]

Zumkeller number

744 is also a Zumkeller number whose divisors can be partitioned into two disjoint sets with equal sum: 960.[28]

It is the 168th indexed Zumkeller number. The two sets of divisors of 744 with equal sums are:

  • (1, 2, 3, 4, 8, 12, 62, 124, 744)
  • (6, 24, 31, 186, 93, 248, 372)

The index of 744 as a Zumkeller number (168) represents the product of the first two perfect numbers 6 × 28.[29] It is the fifth Dedekind number,[30] where the previous four members (2, 3, 6, 20) add to 31 — with 496 the thirty-first triangular number,[7] and third perfect number (168 is also the number of primes below 1000).[31][32]

960 is the thirty-first Jordan–Pólya number that is the product of factorials 5! × (2!)3,[33] equal to the sum of six consecutive prime numbers 149 + 151 + 157 + 163 + 167 + 173, between the 35th and 40th primes (it is the thirty-fifth such number).[34] The fifteenth and sixteenth triangular numbers generate the sum 120 + 136 = 256 = 28 that is the totient value of 960,[27] and the number of partitions of 29 = 1 + 2 + 3 + 5 + 7 + 11 = 22 + 32 + 42 into distinct parts and odd parts.[35] Like its twin prime 31, 29 is a primorial prime, which together comprise the third and largest of three known pairs of twin primes (1st, 2nd, and 5th) to be primorial primes,[36] with possibly no larger pairs. In between these lies 30.

φ(σ(744)) = 744

744 is the sixth number whose totient value has a sum-of-divisors equal to .[37] Otherwise, the aliquot sum of 744, which represents the sum of all divisors of 744 aside from itself, is 1176[10] which is the forty-eighth triangular number,[7] and the binomial coefficient present inside the forty-ninth row of Pascal's triangle.[38] 1176 is also one of two middle terms in the twelfth row of a Pascal triangle.[39] In the triangle of Narayana numbers, 1176 appears as the fortieth and forty-second terms in the eighth row,[40] which also includes 336 (the totient of 1176)[27] and 36 (the square of 6). Inside the triangle of Lah numbers of the form , 1176 is a member with n = 8 and k = 6.[41] It is a self-Fibonacci number; the fifty-first indexed member where in its case divides ,[42] and the forty-first 6-almost prime that is divisible by exactly six primes with multiplicity.[43]

In total, only seven numbers have sums of divisors equal to 744; they are: 240, 350, 366, 368, 575, 671, and 743.[44] The sum of all these seven integers whose sum-of-divisors are in equivalence with 744 is 3313, the 466th prime number[31] and 31st balanced prime,[45] as the middle member of the 49th triplet of sexy primes (3307, 3313, 3319);[46] it is respectively the 178th and 179th such prime p where p − 6[47] and p + 6[48] are prime — where 178 is the 132nd composite number,[49] itself the prime index of the largest number (743) to hold a sum-of-divisors of 744.[31][44] 3313 is also the 24th centered dodecagonal or star number[50] (and 15th that is prime).[51] Divided into two numbers, 3313 is the sum of 1656 and 1657, the latter being the 260th prime number, an index value in-turn that is the first of five numbers to have a sum-of-divisors of 588,[44] which is half of 1176 (the aliquot sum of 744);[10] its arithmetic mean of divisors (of 260), on the other hand, is equal to 49.[5][6] Furthermore, 260 is the average of divisors of 2232 (the fourth largest of five numbers to hold this value), which is thrice 744.

When only the fourteen proper divisors of 744 are considered, then the sum generated by these is 1175, whose six divisors contain an arithmetic mean of 248,[6] the third (or fourteenth) largest divisor of 744. Only one number has an aliquot sum that is 744, it is 456.[10]

Pernicious number

In binary 744 is a pernicious number, as its digit representation (10111010002) contains a prime count (5) of ones.[52]

744 is the four hundred and sixth indexed pernicious number, where 406 is the twenty-eighth triangular number;[7] in its base-two representation, the digit positions of zeroes are in 1:1:3 or 3:1:1 ratio with the positions of ones, which are in 1:3:1 ratio.
Its ones' complement is 1000101112, equivalent to 279 = 32 × 31 in decimal, which represents the sum of GCDs of parts in all partitions of 16 = 42.[53] It is also the number of partitions of 62 = 2 × 31 (a divisor of 744) as well as 63 into factorial parts (without including 0!),[54] and the number of integer partitions of 44 whose length is equal to the LCM of all parts[55] (with 63 the forty-fourth composite number,[49] where 44 is itself the number of derangements of 5,[56] and 63 + 44 = 107 the twenty-eighth prime number).[31]

211210 is the number of repeating decimal digits of 2113 as a full repetend prime in decimal,[57] where 2112 is the 65th interprime to lie between consecutive twin primes,[58] otherwise it is the 317th member between consecutive odd primes,[59] where 317 is the 66th indexed prime number (with 90 and 91 the 65th and 66th composites, respectively, where 181 = 90 + 91).[31][49] 279, on the other hand, is the 58th number to lie between consecutive odd prime numbers (277, 281),[59] with 81 = 92 the fifty-eighth composite number.[49] More specifically, eighty-one is the sum of the repeating digits of the third full repetend prime in decimal, 19,[57] where the sum of these digits is the magic constant of an 18 × 18 non-normal yet full prime reciprocal magic square based on its reciprocal (1/19).[60][61][62]

Meanwhile, in septenary 744 is palindromic (21127),[63]

Semiperfect number

744 is the 183rd semiperfect number, since it is equal to the sum of a subset of its divisors (e.g., 1 + 2 + 4 + 24 + 62 + 93 + 124 + 186 + 248).[64]

Abundance and in full repetend primes

744 is the 181st abundant number,[65] with an abundance of 432.[66]

Convolution of Fibonacci numbers

744 is the twelfth self-convolution of Fibonacci numbers, which is equivalently the number of elements in all subsets of with no consecutive integers.[67][68][69]

In graph theory

The number of Euler tours (or Eulerian cycles) of the complete, undirected graph on six vertices and fifteen edges is 744.[70]

In the Riemann zeta function

The sequence of self-convoluted Fibonacci numbers starts {0, 0, 1, 2, 5, 10, 20, 38, 71, 130, 235, 420, 744, 1308, 2285, 3970, 6865, 11822...}.[68] The sum of the first seven terms (from the zeroth through the sixth term) is equal to 38, which is equivalent to the a(n) = 7 member in this sequence. Taking the sum of the three terms that lie between 71 and 744 (i.e. 130, 235, 420) yields 785 = 282 + 1, whose aliquot sum is 163,[10] the thirty-eighth prime number.[31] 785 is the 60th number to return 0 for the Mertens function, which also includes 163, the 13th such number.[71] 785 is also the number of irreducible planted trees (of root vertex having degree one) with six leaves of two colors.[72]

1106, the first member in the sum of consecutive composite numbers (in equivalence with 2229 = 743 × 3) that are divisible by the twenty-fifth prime number 97,[73] is the smallest number to return a value of 14 in the inverse Mertens function,[74] where 1106 lies between the 81st pair of sexy primes (1103, 1109).[75] 14 is the floor (and nearest integer)[76] of the imaginary part of the first non-trivial zero in the Riemann zeta function ζ, and the fourteenth indexed floor value is 60[77][78] — sixty is the smallest number with exactly twelve divisors, and there are only two numbers which have a sum-of-divisors of 60: 24 and 38,[44] whose sum is 62 (which is the tenth largest divisor of 744); also, three of nine numbers with totients of 60 are also divisors of 744 (93, 124, and 186, that add to 403).[27] On the other hand, the difference 38 − 24 = 14, where the sixtieth floor value in the imaginary part of its nontrivial zero in ζ is the largest Heegner number 163.

Relation to Robin's theorem

The twentieth prime number is 71, where 31 is the eleventh; in turn, 20 is the eleventh composite number[49] that is also the sixth self-convolution of Fibonacci numbers before 38, which is the prime index of 163. 71 is also part of the largest pair of Brown numbers (71, 7), of only three such pairs; where in its case 72 − 1 = 5040.[79][80] Consequently, both 5040 and 5041 can be represented as sums of non-consecutive factorials, following 746, 745, and 744;[2] where 5040 + 5041 = 10081 holds an aliquot sum of 611, which is the composite index of 744.[49]

5040 is the nineteenth superabundant number[81] that is also the largest factorial that is a highly composite number,[82] and the largest of twenty-seven numbers n for which the inequality σ(n) ≥ eγnloglogn holds, where γ is the Euler–Mascheroni constant; this inequality is shown to fail for all larger numbers if and only if the Riemann hypothesis is true (known as Robin's theorem).[83] 5040 generates a sum-of-divisors 19344 = 13 × 31 × 48 that itself contains four divisors in proportion with 744 (and therefore, divisors also in proportion with 248 as well); which makes it one of only two numbers out of these twenty-seven integers n in Robin's theorem to hold σ(n) such that 744m | σ(n) for any subset of divisors m of n; the only other such number is 240:[84]

  • 19344 ÷ 26 = 744
  • 9672 ÷ 13 = 744
  • 1488 ÷ 2 = 744

Where also 19344 ÷ 78 = 248, with 248 and 744 respectively as the 24th and 30th largest divisors (where in between these is 403 = 13 × 31, which is the middle indexed composite number congruent ±1 mod 6 less than 744 that is not part of its composite totatives); 2418, the 35th largest, is the seventh number n after 744 such that σ(φ(n)) is n.[37] Furthermore, in this sequence of integers in Robin's theorem, between 240 and 5040 lie four numbers, where the sum between the first three of these 360 + 720 + 840 = 1920 is in equivalence with σ(744). The first number to be divisible by all positive non-zero integers less than 11 is the penultimate number in this sequence 2520, where 2520 − 840 − 720 = 960 represents a Zumkeller half from the set of divisors of 744,[28] with σ(720) = 2418[10] (and while 720 + 24 = 744 = 6! + 24, where 720 is the smallest number with thirty divisors,[8] equal to 1176 − 456, a difference between the aliquot sum of 744, and the only number to have an aliquot sum of 744; wherein 720 is also in equivalence with σ(264) = 456 + 264).[10][44] 5040 = 7! = 10 × 9 × 8 × 7 is divisible by the first twelve non-zero integers, except for 11.

j-invariant

The j–invariant holds as a Fourier series q–expansion,

where and the half-period ratio of an elliptic function.[85] The function without the constant term, , is the partition function of the conformal field theory whose symmetries constitute the Monster group.[86]

Almost integers

Ramanujan's constant is the transcendental almost integer[87][88]

This is an example of a more general phenomenon in which numbers of the form turn out to be nearly integers for special values of :[89]: p.20–23 

D4 and F4

is theta series coefficient of four-dimensional cubic lattice [90][91]

In four-dimensional space, three-dimensional cell facets of the three-largest of six regular polytopes (the octaplex, dodecaplex, and tetraplex)[92]: p.292  collectively number

E8 and the Leech lattice

The exceptional Lie algebra has a graded dimension [93] whose character lends to a direct sum equivalent to,[94]: p.7, 9–11 

where the CFT probabilistic partition function for is of character [86]

The twenty-four dimensional Leech lattice can be constructed using three copies of the associated lattice[95][92]: pp.233–235  and with the eight-dimensional octonions (see also, Freudenthal magic square),[96] where the automorphism group of is the smallest exceptional Lie algebra , which embeds inside . In the form of a vertex operator algebra, the Leech lattice VOA is the first aside from (as ) with a central charge of , out of a total seventy-one such modular invariant conformal field theories of holomorphic VOAs of weight one.[97] Known as Schellekens' list, these algebras form deep holes in whose corresponding orbifold constructions are isomorphic to the moonshine module that contains as its automorphism;[98] of these, the second and third largest contain affine structures and that are realized in .

Other properties

Selfie number

It is a "selfie number", where ,[99][100] such that it can be expressed using just its digits (which are only used once, and from left to right) alongside the operators +, -, ×, ÷, ab, √, ! (with concatenation allowed).

This, in likeness of , that is the Euler totient of 456.[27] Where the totient of 744 is 240, that of 456 is 144.[27] 187 is the composite index of 240, where 187 is the 144th composite number.[49] In turn, the sum-of-divisors of 187 is 216 = 63,[44] which is the 168th composite number. Also, the reduced totient of 456 is 36.[24]

Pentagonal numbers

is also the sum of consecutive pentagonal numbers,[101][102]

Where the smallest non-unitary pentagonal pyramidal number is 6, the eleventh is 726 = 6! + 6, and the twenty-fourth is 7200,[103] which is a number with a Euler totient value of 1920,[27] and a reduced totient of 120.[24]

Magic figures

is the magic constant of a six by six magic square consisting of thirty-six consecutive prime numbers, between and inclusive.[104]

The magic square is:

This is the second-smallest magic constant for a 6 × 6 magic square consisting of thirty-six consecutive prime numbers, where the sum between the smallest and largest prime numbers in this square is equal to 41 + 223 = 264. The smallest such constant is 484 = 222[105] whose aliquot sum of 447 is the reverse permutation of the digits of 744 in decimal;[10] specifically, 22 and 264 are respectively the twelfth and fourteenth numbers n whose squares are undulating in decimal, while the thirteenth and penultimate such known number is 26.[106][107][108]: pp.159, 160  The smallest possible magic constant of an n × n magic square consisting only of distinct prime numbers is 120, from an n of 4,[109][110] a value equal to the arithmetic mean of all sixteen divisors of 744;[5][6] otherwise, for n = 6, the smallest magic constant for a six-by-six square with distinct prime numbers is 432,[109] also the abundance of 744.[66]

An 11 × 11 magic square that is normal has a magic constant of 671,[111] which is the sixth and largest composite number to have a sum-of-divisors equal to 744.[44]

Polygonal regions

744 is the number of non-congruent polygonal regions in a regular gon with all diagonals drawn.[112]

Perfect rectangles

There are 744 ways in-which fourteen squares of different sizes fit edge-to-edge inside a larger rectangle.[113]

See also

References

  1. ^ a b Sloane, N. J. A. (ed.). "Sequence A189975 (Numbers with prime factorization pqr^3.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-07-16.
  2. ^ a b Sloane, N. J. A. (ed.). "Sequence A060112 (Sums of nonconsecutive factorial numbers.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-07-16.
  3. ^ Sloane, N. J. A. (ed.). "Sequence A034963 (Sums of four consecutive primes.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-07-16.
  4. ^ Sloane, N. J. A. (ed.). "Sequence A083539 (a(n) is sigma(n) * sigma(n+1) as the product of sigma-values for consecutive integers.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-07-16.
  5. ^ a b c Sloane, N. J. A. (ed.). "Sequence A003601 (Numbers n such that the average of the divisors of n is an integer: sigma_0(n) divides sigma_1(n).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-07-16.
  6. ^ a b c d e Sloane, N. J. A. (ed.). "Sequence A102187 (Arithmetic means of divisors of arithmetic numbers (arithmetic numbers, A003601, are those for which the average of the divisors is an integer).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-07-16.
  7. ^ a b c d Sloane, N. J. A. (ed.). "Sequence A000217 (Triangular number: a(n) is the binomial(n+1,2) equivalent to n*(n+1)/2 that is 0 + 1 + 2 + ... + n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-09-02.
  8. ^ a b Sloane, N. J. A. (ed.). "Sequence A005179 (Smallest number with exactly n divisors.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-11-06.
  9. ^ Sloane, N. J. A. (ed.). "Sequence A000005 (d(n) (also called tau(n) or sigma_0(n)), the number of divisors of n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-28.
  10. ^ a b c d e f g h Sloane, N. J. A. (ed.). "Sequence A001065 (Sum of proper divisors (or aliquot parts) of n: sum of divisors of n that are less than n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-09-02.
  11. ^ Sloane, N. J. A. (ed.). "3x+1 problem". The On-Line Encyclopedia of Integer Sequences. The OEIS Foundation. Retrieved 2023-09-22.
  12. ^ Sloane, N. J. A. (ed.). "Sequence A006577 (Number of halving and tripling steps to reach 1 in '3x+1' problem, or -1 if 1 is never reached.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-09-22.
  13. ^ Sloane, N. J. A. (ed.). "Sequence A000607 (Number of partitions of n into prime parts.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-07-16.
  14. ^ Sloane, N. J. A. (ed.). "Sequence A347586 (Number of partitions of n into at most 4 distinct parts.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-07-16.
  15. ^ Sloane, N. J. A. (ed.). "Sequence A007947 (Largest squarefree number dividing n: the squarefree kernel of n, rad(n), radical of n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-31.
  16. ^ Sloane, N. J. A. (ed.). "Sequence A005153 (Practical numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-04-03.
  17. ^ Sloane, N. J. A. (ed.). "Sequence A345547 (Numbers that are the sum of nine cubes in eight or more ways.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-07-16.
  18. ^ Sloane, N. J. A. (ed.). "Sequence A075308 (Number of n-digit perfect powers.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-07-16.
  19. ^ Sloane, N. J. A. (ed.). "Sequence A006450 (Prime-indexed primes: primes with prime subscripts.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-10-18.
  20. ^ Sloane, N. J. A. (ed.). "Sequence A015723 (Number of parts in all partitions of n into distinct parts.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-20.
  21. ^ Sloane, N. J. A. (ed.). "Sequence A034885 (Record values of sigma(n).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-07-16.
  22. ^ Sloane, N. J. A. (ed.). "Sequence A006002 (a(n) equal to n*(n+1)^2/2 (Sum of the nontriangular numbers between successive triangular numbers. 1, (2), 3, (4, 5), 6, (7, 8, 9), 10, (11, 12, 13, 14), 15, ...))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-08-27.
  23. ^ Sloane, N. J. A. (ed.). "Sequence A081377 (Numbers n such that the set of prime divisors of phi(n) is equal to the set of prime divisors of sigma(n).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-07-16.
  24. ^ a b c Sloane, N. J. A. (ed.). "Sequence A002322 (Reduced totient function psi(n): least k such that x^k is congruent 1 (mod n) for all x prime to n; also known as the Carmichael lambda function (exponent of unit group mod n); also called the universal exponent of n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-08-27.
  25. ^ Sloane, N. J. A. (ed.). "Sequence A038509 (Composite numbers congruent to +-1 mod 6.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  26. ^ Sloane, N. J. A. (ed.). "Sequence A319274 (Osiris or Digit re-assembly numbers: numbers that are equal to the sum of permutations of subsamples of their own digits.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-09-02.
  27. ^ a b c d e f g Cite error: The named reference Etot was invoked but never defined (see the help page).
  28. ^ a b Sloane, N. J. A. (ed.). "Sequence A083207 (Zumkeller or integer-perfect numbers: numbers n whose divisors can be partitioned into two disjoint sets with equal sum.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-07-16.
  29. ^ Sloane, N. J. A. (ed.). "Sequence A000396 (Perfect numbers k: k is equal to the sum of the proper divisors of k.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-09-24.
  30. ^ Sloane, N. J. A. (ed.). "Sequence A000372 (Dedekind numbers or Dedekind's problem: number of monotone Boolean functions of n variables, number of antichains of subsets of an n-set, number of elements in a free distributive lattice on n generators, number of Sperner families.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-30.
  31. ^ a b c d e f Cite error: The named reference PNum was invoked but never defined (see the help page).
  32. ^ Sloane, N. J. A. (ed.). "Sequence A006880 (Number of primes less than 10^n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-30.
  33. ^ Sloane, N. J. A. (ed.). "Sequence A001013 (Jordan-Polya numbers: products of factorial numbers A000142.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-11-12.
  34. ^ Sloane, N. J. A. (ed.). "Sequence A127333 (Numbers that are the sum of 6 consecutive primes.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-08-27.
  35. ^ Sloane, N. J. A. (ed.). "Sequence A000009 (Expansion of Product_{m greater than or equal to 1} (1 + x^m); number of partitions of n into distinct parts; number of partitions of n into odd parts.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-15.
  36. ^ Sloane, N. J. A. (ed.). "Sequence A228486 (Near primorial primes: primes p such that p+1 or p-1 is a primorial number (A002110).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-16.
  37. ^ a b Sloane, N. J. A. (ed.). "Sequence A018784 (Numbers n such that sigma(phi(n)) is n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-07-16.
  38. ^ Sloane, N. J. A. (ed.). "Sequence A017765 (Binomial coefficients C(49,n).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-09-02.
  39. ^ Sloane, N. J. A. (ed.). "Sequence A029600 (Numbers in the (2,3)-Pascal triangle (by row).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-09-02.
    The row is {2, 23, 120, 375, 780, 1134, 1176, 870, 450, 155, 32, 3}.
  40. ^ Sloane, N. J. A. (ed.). "Sequence A001263 (Triangle of Narayana numbers T(n,k) is C(n-1,k-1)*C(n,k-1)/k with 1 less than or equal to k less than or equal to n, read by rows. Also called the Catalan triangle.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-09-02.
  41. ^ Sloane, N. J. A. (ed.). "Sequence A105278 (Triangle read by rows: T(n,k) equal to binomial(n,k)*(n-1)!/(k-1)!.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-09-02.
  42. ^ Sloane, N. J. A. (ed.). "Sequence A127787 (Numbers n such that F(n) divides F(F(n)), where F(n) is a Fibonacci number.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-09-02.
  43. ^ Sloane, N. J. A. (ed.). "Sequence A046306 (Numbers that are divisible by exactly 6 primes with multiplicity.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-09-02.
  44. ^ a b c d e f g Sloane, N. J. A. (ed.). "Sequence A000203 (a(n) equal to sigma(n), the sum of the divisors of n. Also called sigma_1(n).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-09-11.
  45. ^ Sloane, N. J. A. (ed.). "Sequence A006562 (Balanced primes (of order one): primes which are the average of the previous prime and the following prime.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-06.
  46. ^ Sloane, N. J. A. (ed.). "Sequence A046119 (Middle member of a sexy prime triple: value of p+6 such that p, p+6 and p+12 are all prime, but p+18 is not (although p-6 might be).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-06.
  47. ^ Sloane, N. J. A. (ed.). "Sequence A046117 (Primes p such that p-6 is also prime. (Upper of a pair of sexy primes.))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-06.
  48. ^ Sloane, N. J. A. (ed.). "Sequence A023201 (Primes p such that p + 6 is also prime (Lesser of a pair of sexy primes.))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-06.
  49. ^ a b c d e f g Sloane, N. J. A. (ed.). "Sequence A002808 (The composite numbers: numbers n of the form x*y for x > 1 and y > 1.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-09-27.
  50. ^ Sloane, N. J. A. (ed.). "Sequence A003154 (Centered 12-gonal numbers, or centered dodecagonal numbers: numbers of the form 6*k*(k-1) + 1.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-06.
  51. ^ Sloane, N. J. A. (ed.). "Sequence A083577 (Prime star numbers.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-06.
  52. ^ Sloane, N. J. A. (ed.). "Sequence A052294 (Pernicious numbers: numbers with a prime number of 1's in their binary expansion.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-08-28.
  53. ^ Sloane, N. J. A. (ed.). "Sequence A078392 (Sum of GCD's of parts in all partitions of n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-10-01.
  54. ^ Sloane, N. J. A. (ed.). "Sequence A064986 (Number of partitions of n into factorial parts (0! not allowed).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-10-01.
  55. ^ Sloane, N. J. A. (ed.). "Sequence A316433 (Number of integer partitions of n whose length is equal to the LCM of all parts.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-10-01.
  56. ^ Sloane, N. J. A. (ed.). "Sequence A000166 (Subfactorial or rencontres numbers, or derangements: number of permutations of n elements with no fixed points.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-10-01.
  57. ^ a b Cite error: The named reference FullRepP was invoked but never defined (see the help page).
  58. ^ Cite error: The named reference InterP was invoked but never defined (see the help page).
  59. ^ a b Sloane, N. J. A. (ed.). "Sequence A024675 (Average of two consecutive odd primes.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-30.
  60. ^ Andrews, William Symes (1917). Magic Squares and Cubes (PDF). Chicago, IL: Open Court Publishing Company. pp. 176, 177. ISBN 9780486206585. MR 0114763. OCLC 1136401. Zbl 1003.05500.
  61. ^ Sloane, N. J. A. (ed.). "Sequence A021023 (Decimal expansion of 1/19.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-30.
  62. ^ Sloane, N. J. A. (ed.). "Sequence A072359 (Primes p such that the p-1 digits of the decimal expansion of k/p (for k equal to 1,2,3,...,p-1) fit into the k-th row of a magic square grid of order p-1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-30.
  63. ^ Sloane, N. J. A. (ed.). "Sequence A029954 (Palindromic in base 7.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-30.
  64. ^ 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 2023-04-03.
  65. ^ 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 2023-04-03.
  66. ^ a b 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 2023-12-29.
  67. ^ Moree, Pieter (2004). "Convoluted Convolved Fibonacci Numbers" (PDF). Journal of Integer Sequences. 7 (2). Waterloo, Ont., CA: University of Waterloo David R. Cheriton School of Computer Science: 13 (Article 04.2.2). arXiv:math.CO/0311205. Bibcode:2004JIntS...7...22M. MR 2084694. S2CID 14126332. Zbl 1069.11004.
  68. ^ a b Sloane, N. J. A. (ed.). "Sequence A001629 (Self-convolution of Fibonacci numbers.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-07-16.
  69. ^ Belbachir, Hacène; Djellal, Toufik; Luque, Jean-Gabriel (2023). "On the self-convolution of generalized Fibonacci numbers". Quaestiones Mathematicae. 46 (5). Oxfordshire, UK: Taylor & Francis: 841–854. arXiv:1703.00323. doi:10.2989/16073606.2022.2043949. MR 4592901. S2CID 119150217. Zbl 07707543.{{cite journal}}: CS1 maint: Zbl (link)
  70. ^ Sloane, N. J. A. (ed.). "Sequence A350028 (Number of Euler tours of the complete graph on n vertices (minus a matching if n is even).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-07-16.
  71. ^ Cite error: The named reference Mert0 was invoked but never defined (see the help page).
  72. ^ 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 2023-09-02.
  73. ^ Sloane, N. J. A. (ed.). "Sequence A074127 (Group the composite numbers so that the sum of the n-th group is a multiple of the n-th prime: (4), (6), (8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22), (24, 25), (26, 27, 28, 30, 32), (33, 34, ...), ... Sequence gives the group sum divided by n-th prime for the n-th group.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-20.
  74. ^ Sloane, N. J. A. (ed.). "Sequence A051402 (Inverse Mertens function: smallest k such that |M(k)| is equal to n, where M(x) is Mertens's function A002321.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-22.
  75. ^ Sloane, N. J. A. (ed.). "Sequence A023201 (Primes p such that p + 6 is also prime (Lesser of a pair of sexy primes.))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-06.
  76. ^ Sloane, N. J. A. (ed.). "Sequence A002410 (Nearest integer to imaginary part of n-th zero of Riemann zeta function.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-16.
  77. ^ Sloane, N. J. A. (ed.). "Sequence A013629 (Floor of imaginary parts of nontrivial zeros of Riemann zeta function.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-02-07.
  78. ^ Odlyzko, Andrew. "The first 100 (non trivial) zeros of the Riemann Zeta function [AT&T Labs]". Andrew Odlyzko: Home Page. UMN CSE. Retrieved 2024-01-16.
  79. ^ Sloane, N. J. A. (ed.). "Sequence A216071 (Brocard's problem: positive integers m such that m^2 equal to n! + 1 for some n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-10-10.
  80. ^ Sloane, N. J. A. (ed.). "Sequence A085692 (Brocard's problem: squares which can be written as n!+1 for some n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-10-10.
  81. ^ Sloane, N. J. A. (ed.). "Sequence A004394 (Superabundant [or super-abundant] numbers: n such that sigma(n)/n greater than sigma(m)/m for all m less than n, sigma(n) being A000203(n), the sum of the divisors of n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-10-10.
  82. ^ Sloane, N. J. A. (ed.). "Sequence A002182 (Highly composite numbers, definition (1): numbers n where d(n), the number of divisors of n (A000005), increases to a record.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-10-10.
  83. ^ Sloane, N. J. A. (ed.). "Sequence A067698 (Positive integers such that sigma(n) greater than or equal to exp(gamma) * n * log(log(n)).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-10-09.
  84. ^ Caveney, Geoffrey; Nicolas, Jean-Louis; Sondow, Jonathan (2011). "Robin's Theorem, Primes, and a New Elementary Reformulation of the Riemann Hypothesis". Integers. 11 (6). Berlin: De Gruyter: 755 (A33). arXiv:1110.5078. doi:10.1515/INTEG.2011.057. MR 2798609. S2CID 14573608. Zbl 1235.11082.
  85. ^ 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.
  86. ^ a b Gaberdiel, Matthias R. (2007). "Constraints on extremal self-dual CFTs". Journal of High Energy Physics. 2007 (11, 087). Springer: 10–11. arXiv:0707.4073. Bibcode:2007JHEP...11..087G. doi:10.1088/1126-6708/2007/11/087. MR 2362062. S2CID 16635058.
  87. ^ Sloane, N. J. A. (ed.). "Sequence A060295 (Decimal expansion of exp(Pi*sqrt(163)).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-08-18.
  88. ^ Barrow, John D. (2002). "The Constants of Nature". The Fundamental Constants. London: Jonathan Cape. p. 72. doi:10.1142/9789812818201_0001. ISBN 0-224-06135-6. S2CID 125272999.
  89. ^ Klaise, Janis (2012). Orders in Quadratic Imaginary Fields of small Class Number (PDF) (MMath thesis). University of Warwick Centre for Complexity Science. pp. 1–24. S2CID 126035072.
  90. ^ Sloane, N. J. A. (ed.). "Sequence A004011 (Theta series of D_4 lattice; Fourier coefficients of Eisenstein series E_{gamma,2}.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-23.
  91. ^ Chun, Ji Hoon (2019). "Sphere Packings [2013]" (PDF). In Tsfasman, Michael; et al. (eds.). Algebraic Geometry Codes: Advanced Chapters. Mathematical Surveys and Monographs. Vol. 238. Providence, RI: American Mathematical Society. pp. 229−278. doi:10.1090/surv/238. ISBN 978-1-4704-5263-6. MR 3966406. S2CID 182109921. Zbl 1422.14004.
  92. ^ a b Coxeter, H. S. M. (1948). Regular Polytopes (1st ed.). London: Methuen & Co. pp. 1–321. ISBN 9780521201254. MR 0027148. OCLC 472190910.
  93. ^ Sloane, N. J. A. (ed.). "Sequence A121732 (Dimensions of the irreducible representations of the simple Lie algebra of type E8 over the complex numbers, listed in increasing order.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-10-05.
  94. ^ Cite error: The named reference TGann was invoked but never defined (see the help page).
  95. ^ Conway, John H.; Sloane, N. J. A. (1988). "Algebraic Constructions for Lattices". Sphere Packings, Lattices and Groups. New York, NY: Springer. doi:10.1007/978-1-4757-2016-7. eISSN 2196-9701. ISBN 978-1-4757-2016-7. MR 1541550.
  96. ^ Wilson, Robert A. (2009). "Octonions and the Leech lattice". Journal of Algebra. 322 (6): 2186–2190. doi:10.1016/j.jalgebra.2009.03.021. MR 2542837.
  97. ^ Schellekens, Adrian Norbert (1993). "Meromorphic c = 24 conformal field theories". Communications in Mathematical Physics. 153 (1). Berlin: Springer: 159–185. arXiv:hep-th/9205072. Bibcode:1993CMaPh.153..159S. doi:10.1007/BF02099044. MR 1213740. S2CID 250425623. Zbl 0782.17014.
  98. ^ Möller, Sven; Scheithauer, Nils R. (2023). "Dimension formulae and generalised deep holes of the Leech lattice vertex operator algebra". Annals of Mathematics. 197 (1). Princeton University & the Institute for Advanced Study: 261–285. arXiv:1910.04947. Bibcode:2019arXiv191004947M. doi:10.4007/annals.2023.197.1.4. MR 4513145. S2CID 204401905. Zbl 1529.17040.
  99. ^ Taneja, Inder J. (2016). "Selfie Numbers - IV: Addition, Subtraction and Factorial" (PDF). RGMIA Research Report Collection. 19: 1−4 (Article 163).
  100. ^ Sloane, N. J. A. (ed.). "Sequence A193069 (Pretty wild narcissistic numbers - numbers that pwn: - an integer n that can be expressed using just the digits of n (each digit used once only and in order from left to right) and the operators + - * / ^ ! and the radical symbol. Concatenation is allowed.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-02-12.
  101. ^ Sloane, N. J. A. (ed.). "Sequence A129863 (Sums of three consecutive pentagonal numbers.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-07-16.
  102. ^ Sloane, N. J. A. (ed.). "Sequence A000326 (Pentagonal numbers.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-07-16.
  103. ^ Sloane, N. J. A. (ed.). "Sequence A002411 (Pentagonal pyramidal numbers: a(n) equal to n^2*(n+1)/2.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-11-09.
  104. ^ Sloane, N. J. A. (ed.). "Sequence A177434 (The magic constants of 6 X 6 magic squares composed of consecutive primes.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-07-16.
  105. ^ Sloane, N. J. A. (ed.). "Sequence A177434 (The magic constants of 6 X 6 magic squares composed of consecutive primes.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-09-11.
  106. ^ Sloane, N. J. A. (ed.). "Sequence A122875 (Numbers whose square is undulating.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-11-02.
  107. ^ Sloane, N. J. A. (ed.). "Sequence A016073 (Undulating squares.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-11-02.
  108. ^ Pickover, Clifford A. (1995). "Chapter 20: The Undulation of the Monks". Keys to Infinity. New York, NY: John Wiley & Sons, Inc. pp. xviii, 1−332. ISBN 978-0471193340. OCLC 31710129. S2CID 121761396.
  109. ^ a b Sloane, N. J. A. (ed.). "Sequence A164843 (The smallest magic constant of an n X n magic square with distinct prime entries.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-11-05.
  110. ^ Makarova, Natalia V. "Least Magic Squares of Prime Numbers (Part I)". klassikpoez.narod.ru (in Russian). Archived translation in English. Retrieved 2023-12-07.
  111. ^ Sloane, N. J. A. (ed.). "Sequence A006003 (a(n) equal to n*(n^2 + 1)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-09-11.
  112. ^ Sloane, N. J. A. (ed.). "Sequence A187781 (Number of noncongruent polygonal regions in a regular n-gon with all diagonals drawn.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-23.
  113. ^ Sloane, N. J. A. (ed.). "Sequence A002839 (Number of simple perfect squared rectangles of order n up to symmetry.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-07-16.