Jump to content

744 (number)

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Davey2116 (talk | contribs) at 03:02, 7 August 2024 (Restore info). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

← 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 semiperfect, 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]

744 is the 183rd semiperfect number, an index value whose sum-of-divisors is 248,[44] with an arithmetic mean of divisors equal to 62 = 31 × 2,[5][6] both of which are divisors of 744 (fourteenth and tenth largest, respectively); otherwise, the sum of its two divisors greater than 1 is 3 + 61 = 64 = 82. 183 is also the eighth perfect totient number,[65] and the number of semiorders on four labeled elements.[66] It is the largest number of interior regions formed by fourteen intersecting circles, which is equivalent to the number of points in the projective plane over the finite field , since 132 + 13 + 1 = 183.[67] It is the number of toothpicks in the toothpick sequence after eighteen stages.[68] Following, 181, 183 is the sixty-second Löschian number of the form x2 + xy + y2, as a product of the third and twenty-fourth such numbers (3, 61), of prime indices two and eighteen.[69][31] Furthermore, the smallest number to have exactly four solutions to this quadratic polynomial is the first taxicab number 1729, from (a,b) integer pairs (3, 40), (8, 37), (15, 32) and (23, 25),[70][71] where these four pairs collectively generate a sum of 183. The smallest such number with only two solutions, on the other hand, is 49;[72] wherein 1729 is the 97th such number expressible in two, or more, ways.[73] The probability that any odd number is a Löschian number is 0.75, while the probability that it is an even number is a remaining 0.25.[74]

There are precisely 816 integers (uninclusively, equal to the sum-of-divisors of 737, the largest composite totative of 744)[44] between the semiperfect index of 744 and 1000, a number that in-turn has a sum-of-divisors of 2232 = 744 × 3[44] — the 24th decagonal number,[75] as well as the 30th number that can be expressed as the difference of the squares of consecutive primes in just one distinct way;[76] other members in this sequence include:

  • 1920 (26th), the sum-of-divisors of 744,[44]
  • 1728 (24th), equal to the cube of 12, and one less than the first taxicab number,
  • 432 (8th), the abundance of 744,[77]
  • 288 (6th), the difference between 744 and 456, the only number to have an aliquot sum of 744,[10]
  • 240 (5th), the Euler totient of 744.[27]

888 is the 13th member, the 26th repdigit in decimal[78] equal to the sum between 432 and 456, and between 144 and 744 (where 432 and 456 both have totient values of 144);[27] and equal to the product between the twelfth prime number 37, and 24. The first four members (5, 16, 24, 48) generate a sum of 93, which is the eleventh largest divisor of 744, following 62.[76] 93 represents the number of different cyclic Gilbreath permutations on 11 elements,[79] and consequently there are ninety-three different real periodic points of order 11 on the Mandelbrot set.[80]

Otherwise, 1632 = 1176 + 456, in equivalence with the aliquot sum of 744 (1176)[10] and 456, is the sixteenth number that can be expressed as the difference of the squares of primes in just two distinct ways, consecutive or otherwise (432, 1728, 1920 and 2232 are also in this sequence).[81]

183 is also the first non-trivial 62-gonal number.

Abundance and in full repetend primes

744 is an abundant number,[82] with an abundance of 432.[77]

744 is the 181st abundant number. Specifically, 432 (twice 216, the cube of 6) has an aliquot sum of 808,[10] where 433 is the thirty-first full repetend prime in decimal that repeats 432 digits, which collectively add to 1944.[57] Less than 1000, the sixtieth and largest such prime number is 983, which repeats 982 digits that sum to 4419, a two-digit dual permutation of the digits of 1944 (and where 2475 = 4419 − 1944 has a reduced totient of 60).[24] 432 is also the twenty-third interprime between twin primes,[58] and the eighth such number whose adjacent prime numbers have prime indices that add to a prime number (167 = 83 + 84, the thirty-ninth prime);[31] 348, the composite index of 432,[49] is itself the sixth interprime whose adjacent prime numbers have indices that add to a prime number (139 = 69 + 70, the thirty-fourth prime).[31] Importantly, 432 = 33 + 43 + 53 + 63[83] is an Achilles number, a powerful number (the thirty-fourth)[84] that is itself not a perfect power, like 864 (the eleventh index, that is twice its value), and 288 (the totient of 864),[27] as well as 108 (a fourth of 432), and 1944.[85] (432 is the sixth member, where the sixth triangular number is 21,[7] itself the index of 1944 in the list of Achilles numbers. Also, 1944 = 1200 + 744, where 1200 = 456 + 744, or in other words σ(456).)[44] On the other hand, 181, the index of 744 as an abundant number, is the sixteenth full repetend prime in base ten,[57] and the composite index of 232,[49] that is the sum of the first five interprimes to lie in-between twin primes with prime sums from respective indices (i.e., 138, 72, 12, 6, 4), as with 432 and 348.[58] 109 is the tenth full repetend prime, repeating 108 digits whose sum of repeating digits is 486, a fourth of 1944, where 487 is the thirty-third full repetend prime (and 811 the forty-ninth, one less than the sum of the 180 repeating digits of 181; with 288 = 180 + 108).[57]

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.[86][87][88]

In graph theory

The number of Euler tours (or Eulerian cycles) of the complete, undirected graph on six vertices and fifteen edges is 744.[89] On seven vertices, there are 129,976,320 Euler tours. These can only be generated on complete graphs with at least three vertices; the number of tours for three, four and five vertices are respectively 2, 2 and 264 (the latter is the second digit-reassembly number in base ten).[26] On the other hand, the number of Euler tours of the complete digraph, or directed graph, on four vertices is 256, while on five vertices it is 972,000 (and 247,669,456,896 on six vertices), by the BEST theorem.[90]

Regarding the largest prime totative of 744, there are (aside from the sets that are the union of all such solutions),

Thrice 743 is 2229, whose average of divisors is 744 (as with thrice any prime number , the average of divisors will be ).[5][6] This value is a difference of 1110 from 3339, which is the sum of seven hundred and forty-two (742) repeating digits of the reciprocal of 743, as the forty-eighth full repetend prime in decimal[57] (with the smallest number to have a Euler totient of 744 being 1119).[27]

j-invariant

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

where and the half-period ratio of an elliptic function.[96]

The j–invariant can be computed using Eisenstein series and , such that: where specifically, these Eisenstein series are equal to and with .

The respective q–expansions of these two Eisenstein series have coefficients whose numerical values are in proportion to 240 and −504, respectively;[97][98] where specifically the sum and difference between the absolute values of these two numbers is 240 + 504 = 744 and 504 − 240 = 264. Furthermore, when considering the only smaller even (here, non-modular) series the sum between the absolute value of its constant multiplicative term (24) and that of (240) is equal to 264 as well. The 16th coefficient in the expansion of is −744, as is its 25th coefficient.[99]

Alternatively, the j–invariant can be computed using a sextic polynomial as: where represents the modular function, with 256 = 28.[100]

Almost integers

Also, the almost integer[101]

This number is known as Ramanujan's constant, which is transcendental.[102] Mark Ronan and other prominent mathematicians have noted that the appearance of in this number is relevant within moonshine theory, where one hundred and sixty-three is the largest of nine Heegner numbers that are square-free positive integers such that the imaginary quadratic field has class number of (equivalently, the ring of integers over the same algebraic number field have unique factorization).[103]: pp.227, 228  has one hundred and ninety-four (194 = 97 × 2) conjugacy classes generated from its character table that collectively produces the same number of elliptic moonshine functions which are not all linearly independent; only one hundred and sixty-three are entirely independent of one another.[104] The linear term of error for Ramanujan's constant is approximately,

where is the value of the minimal faithful complex dimensional representation of the Friendly Giant , the largest sporadic group.[105] contains an infinitely graded faithful dimensional representation equivalent to the coefficients of the series of the q-expansion of the j-invariant. Specifically, all three common prime factors that divide the Euler totient, sum-of-divisors, and reduced totient of are the smallest and only primes that divide the orders of all twenty-six sporadic groups, in contrast with only six groups whose orders can be divided by the largest consecutive supersingular prime and largest prime factor of seven hundred and forty-four, ;[103]: pp.244–246  three of these belong inside the small family of six pariah groups that are not subquotients of [106] The largest supersingular prime that divides the order of is [107][108] which is the eighth self-convolution of Fibonacci numbers, where is the twelfth.[87]

Other almost integers

The largest three Heegner numbers with also give rise to almost integers of the form which involve . In increasing orders of approximation,[109]: p.20–23 

Square-free positive integers over the negated imaginary quadratic field with class number of also produce almost integers for values of , where for instance there is [110][111]

|nint(x) − x| ≤ 10−3

In the list of thirteen integers n ≤ 1000 that yield almost integers — with nearness |nint(x) − x| ≤ 10−3 for values xeπn — the smallest n of these is 25, that is also the smallest composite totative of 744. Less than 103, the largest such n is 719 = 6! − 1, where 719 represents the 128th indexed prime number;[31] the sum generated by these two n is in equivalence with 719 + 25 = 744.
The middle indexed value in between these two bounds is 148, the twelfth square-free positive integer d over the negated imaginary quadratic field of class number 2, followed by 163 and 232, the latter of which is the fourteenth square-free positive integer d over the imaginary quadratic field √−d of class number 2 (only these two numbers 148 and 232 for d in this field of class number 2 yield almost integers with |nint(x) − x| ≤ 10−3, where 163 is the largest over the same field with class number 1).[111] In this same list, the three distinct non-supersingular primes (37, 43, 67) that only divide orders of pariah groups are also n (less than 148) that yield almost integers of the form eπn. In the almost integer representation for eπ√148 specified, 8 × 103 = j(√(2i)) = 203, the class 1 j−invariant of order d = −8,[112] that is also a root in Ψ2(X, X) = −(X − 8000) × (X + 3375)2 × (X − 1728), a polynomial for supersingular 2-isogeny graphs with loops (it is also a root in Ψ3).[113][114] The remaining two n (58, 74) in the list of these almost integers with nearness |nint(x) − x| ≤ 10−3 of n less than 148 generate a sum of 58 + 74 = 132 equal to the prime index of 743,[31] the largest prime totative of 744 (and, where 2 × 37 = 74 = 148 ÷ 2).

|nint(x) − x| ≤ 10−2

For almost integers with nearness |nint(x) − x| ≤ 10−2, the smallest such number is eπ6 with n of 6, approximately equal to 2197.99087.[115] Whereas 2198 holds eight divisors that produce an arithmetic mean of 474[5][6] (and where 474 holds a sum-of-divisors equal to 960,[44] also the Zumkeller half from the set of divisors of 744),[28] 2199 is the sixteenth perfect totient number,[65] with an aliquot sum of 737[10] equivalent with the largest composite totative of 744. Also, 2197 = 133. There are a total of twenty-six almost integers with |nint(x) − x| ≤ 10−2 where xeπn and n ≤ 103, where the largest n holds a value of 986.[115] The sum between the upper and lower bounds n less than one thousand with this almost integer degree of nearness is equal to 6 + 986 = 992 = 744 + 248. Regarding 992, the numbers 336 (the totient of 1176,[27] which is the sum-of-divisors of 744), 496 (the 31st triangular number and third perfect number),[7][29] and 525 — the sum of all prime numbers that divide the orders of the twenty-six (or twenty-seven) sporadic groups,[116] equal to the sum of the dimensions of all five exceptional Lie algebras[117] — are the first three of only four composites to have a sum-of-divisors of 992.[44] Furthermore, the fifth such number is 775, whose composite index is 637, equal to the sum of all prime factors (inclusive of multiplicities) in the order of the largest sporadic group, |1| = 246 × 320 × 59 × 76 × 112 × 133 × 17 × 19 × 23 × 29 × 31 × 41 × 47 × 59 × 71.[103]: pp.244–246  In Chowla's function that counts the sum-of-divisors of n except for 1 and and n, 525 holds a value of 466[118] that is the prime index of 3313,[31] equal to the sum of all seven numbers (240, 350, 366, 368, 575, 671, and 743) to hold a sum-of-divisors of 744;[44] with 240 the totient of 525 as well (the 13th of 31 numbers to hold this value).[27]

Square-free integers of class number 3

Regarding square-free integers of class number h = 3, there are a total of sixteen (or twenty-five when including non-maximal orders),[119] the largest with value of 907 that is the 155th indexed prime number,[31] equal to the sum 163 + 744, that is also the greater of consecutive primes (887, 907) that generate the seventh largest record prime gap (of 20).[120][121][122][123][124] The previous greatest prime gap is of 18 set by (523, 541) (following the thirtieth and thirty-first prime numbers 113 and 127 with a gap of 14), the 99th and 100th prime numbers,[31] the former also the composie index of 132,[49] and the latter the tenth star number[50] and 53rd number to return 0 for the Mertens function (where 427 is the 50th, and 163 the 13th).[125]

In the full list of largest square-free positive integers with class numbers h ≤ 100,[126][127] ten of these maximum values are held by larger integers when non-maximal orders in their respective classes are included, where nine of these are uniquely biprimes divisible by 163 (the only exception is the largest value for square-free integers of class number 16); the largest of these in this bound is 821683 = 712 × 163 of class number h = 70.[109]: 18−20  In the difference between the largest class 1 and 2 square-free integers, there is 427 − 163 = 264. Of the square-free integers of class number three, only 59 produces an almost integer of the form xeπn with |nint(x) − x| ≤ 10−2 (for integers of class number h = 4, the largest such number is 1555 — whose square divides 61554[128] — while the ninth such largest discriminant is 155).[129]

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...}.[87] 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.[125] 785 is also the number of irreducible planted trees (of root vertex having degree one) with six leaves of two colors.[130]

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,[131] is the smallest number to return a value of 14 in the inverse Mertens function,[132] where 1106 lies between the 81st pair of sexy primes (1103, 1109).[133] 14 is the floor (and nearest integer)[134] of the imaginary part of the first non-trivial zero in the Riemann zeta function ζ, and the fourteenth indexed floor value is 60[135][136] — 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.

In 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.[137][138] 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[139] that is also the largest factorial that is a highly composite number,[140] 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).[141] 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:[142]

  • 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.

D4 and F4

is theta series coefficient of four-dimensional cubic lattice [143][144] On the other hand, in the theta series of the four-dimensional body-centered cubic lattice — whose geometry with defines Hurwitz quaternions of even and odd square norm as realized in the –cell honeycomb that is dual to the –cell honeycomb (and, as a union of two self-dual tesseractic –cell honeycombs) — the sixteenth coefficient is the seven hundred and forty-fourth coefficient in the series;[145] with coefficient index the forty-ninth non-zero norm.[146]

+
4
as a lattice is the union of two lattices,[144] where the associated theta series of has 744 as its 50th indexed coefficient (as with theta series of ),[147][143] and where its twenty-fifth coefficient is 248, which is the most important divisor of 744. Also, in this theta series of , the preceding 49th coefficient is 456, the only number to hold an aliquot sum of 744,[10] where 744 − 456 = 288, a value that is the number of cells in the disphenoidal 288-cell, whose 48 vertices collectively represent the twenty-four Hurwitz unit quaternions with norm squared 1, united with the twenty-four vertices of the dual 24-cell with norm squared 2. For the theta series of , that is realized in the 16-cell honeycomb, all 25 × 2m indexed coefficients (i.e. 25, 50, 100, 200, 400, ...) are 744.[147] For both the theta series of and , the 456th coefficient is 1920, the sum-of-divisors of 744.[44]

For the theta series of the four-dimensional lattice, coefficient index 288 is the 97th non-zero norm, coeff. index 456 the 153rd (an index that represents the seventeenth triangular number), and coeff. index 744 the 250th;[146] the latter, a coefficient index that is the largest of only four numbers to hold a Euler totient of 100: 101, 125, 202, and 250[27] — the smallest of these is the twenty-sixth prime number, while the largest 250 = 2 × 53 has a sum of prime factors that is 17, the seventh prime number;[31] and where 202 = 49 + 153 and 250 = 153 + 97, with 549 = 49 + 97 + 153 + 250, the 447th indexed composite number.[49] More deeply, for the theta series of 744 is a prime-indexed coefficient over its first six indices less than 104 (respectively, the 458th, 526th, 742nd, 799th, 842nd, and 1141st prime indices, with a sum of 4058; the latter in equivalence with 1141 = 7 × 163).[145] The first composite coeff. index in the series with coefficient 744 is its seventh index 9251 = 11 × 292, whose sum of prime factors, inclusive of 1, is 70 (which is of algebraic significance in terms of the construction of the twenty-four-dimensional Leech lattice). 456, and 1176, the aliquot sum of 744,[10] are also prime-indexed coefficients over their first two coefficient indices (346th, 364th, and 1098th, 1159th, respectively).[145]

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

E8 and the Leech lattice

Within finite simple groups of Lie type, exceptional Lie algebra holds a minimal faithful representation in two hundred and forty-eight dimensions, where divides thrice over.[149][150]: p.4  John McKay noted an intersection between finite simple groups of Lie type and those that are sporadic, where symmetries of nodes in the Dynkin diagrams of complex Lie algebra as well as those of and respectively coincide with the three largest conjugacy classes of ; where also the corresponding McKay–Thompson series of sporadic Thompson group holds coefficients representative of its faithful dimensional representation (also minimal at )[151][105] whose values themselves embed irreducible representation of .[152]: p.6  In turn, exceptional Lie algebra is shown to have a graded dimension [153] whose character lends to a direct sum equivalent to,[152]: p.7, 9–11 

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

The twenty-four dimensional Leech lattice in turn can be constructed using three copies of the associated lattice[155][148]: pp.233–235  and with the eight-dimensional octonions (see also, Freudenthal magic square),[156] 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.[157] 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;[158] of these, the second and third largest contain affine structures and that are realized in .

Of these, is isomorphic to the tensor product ; also, affine structure is different from , which is associated with even positive definite unimodular lattice .[159][160] and are associated with codes and that are two of only nine in-equivalent doubly even self-dual codes of length 24 and weight 4.[161][162] The largest of these vertex operator algebras () is realized in dimension , where successively halving its dimensional space leads to a dimensional space.[163][164]

Other properties

Selfie number

It is a "selfie number", where ,[165][166] 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,[167][168]

Where the smallest non-unitary pentagonal pyramidal number is 6, the eleventh is 726 = 6! + 6, and the twenty-fourth is 7200,[169] 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.[170]

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[171] 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.[172][173][174]: 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,[175][176] 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,[175] also the abundance of 744.[77]

An 11 × 11 magic square that is normal has a magic constant of 671,[177] 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.[178] Otherwise, 992 = 248 + 744 is the least possible number of diagonals of a simple convex polyhedron with thirty-six faces; for sixteen and twenty faces, there are respectively a minimum of 132 and 240 diagonals[179] (values which represent the prime index of the largest prime totative of 744 and the count of all its totatives),[27] where 132 + 240 = 372, or half 744 (alongside respective indices that generate a sum of 36).

Perfect rectangles

There are seven hundred and forty-four ways in-which fourteen squares of different sizes fit edge-to-edge inside a larger rectangle.[180] Meanwhile, 456 (the only number to have an aliquot sum of 744)[10] is the maximum number of unit squares — only joined at corners — that can be inscribed inside a square (of area 1600u2).[181]

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 d e f 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 f g h 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 e f 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 i j k l m n o 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 d 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. ^ a b 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 h i j k l m n o Sloane, N. J. A. (ed.). "Sequence A000010 (Euler totient function phi(n): count numbers less than or equal to n and prime to n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-07-16.
  28. ^ a b c 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. ^ a b 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 g h i j k l m n o Sloane, N. J. A. (ed.). "Sequence A000040 (The prime numbers.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-09-06.
  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 h i j k l m n o p 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 h i j k 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. ^ a b 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 c d e f Sloane, N. J. A. (ed.). "Sequence A001913 (Full reptend primes: primes with primitive root 10.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-15.
  58. ^ a b c Sloane, N. J. A. (ed.). "Sequence A014574 (Average of twin prime pairs.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-30.
  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. ^ a b Sloane, N. J. A. (ed.). "Sequence A082897 (Perfect totient numbers.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-10-21.
  66. ^ Sloane, N. J. A. (ed.). "Sequence A006531 (Semiorders on n elements.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-02.
  67. ^ Sloane, N. J. A. (ed.). "Sequence A002061 (Central polygonal numbers: a(n) equal to n^2 - n + 1.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-02.
  68. ^ Sloane, N. J. A. (ed.). "Sequence A139250 (Toothpick sequence (see Comments lines for definition).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-02.
  69. ^ Sloane, N. J. A. (ed.). "Sequence A003136 (Loeschian numbers: numbers of the form x^2 + xy + y^2; norms of vectors in A2 lattice.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-01-02.
  70. ^ Mitchell, David (February 25, 2017). "Tessellating the Ramanujan-Hardy Taxicab Number, 1729, Bedrock of Integer Sequence A198775". atticeLabyrinths. Retrieved 19 July 2018.
  71. ^ Sloane, N. J. A. (ed.). "Sequence A198775 (Numbers having exactly four representations by the quadratic form x^2+xy+y^2 with 0 less than or equal to x less than or equal to y.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-03.
  72. ^ Sloane, N. J. A. (ed.). "Sequence A198773 (Numbers having exactly two representations by the quadratic form x^2+xy+y^2 with 0 less than or equal to x less than or equal to y.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-03.
  73. ^ Sloane, N. J. A. (ed.). "Sequence A118886 (Numbers expressible as x^2 + x*y + y^2, 0 less than or equal to x less than or equal to y in 2 or more ways.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-03.,
  74. ^ Marshall, John U. (1975). "The Loeschian numbers as a problem in number theory" (PDF). Geographical Analysis. 7 (4): 421–426. Bibcode:1975GeoAn...7..421M. doi:10.1111/j.1538-4632.1975.tb01054.x – via OEIS.
  75. ^ Sloane, N. J. A. (ed.). "Sequence A001107 (10-gonal (or decagonal) numbers: a(n) is n*(4*n-3).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-01-03.
  76. ^ a b Sloane, N. J. A. (ed.). "Sequence A090785 (Numbers that can be expressed as the difference of the squares of consecutive primes in just one way.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-01-03.
  77. ^ a b c 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.
  78. ^ Sloane, N. J. A. (ed.). "Sequence A010785 (Repdigit numbers, or numbers whose digits are all equal.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-19.
  79. ^ Sloane, N. J. A. (ed.). "Sequence A000048 (Number of n-bead necklaces with beads of 2 colors and primitive period n, when turning over is not allowed but the two colors can be interchanged.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-01-03.
  80. ^ Diaconis, Persi; Graham, Ron (2011). "Chapter 5: From the Gilbreath Principle to the Mandelbrot Set" (PDF). Magical Mathematics: The Mathematical Ideas that Animate Great Magic Tricks. Princeton University Press. pp. 61–83. doi:10.1515/9781400839384-007. ISBN 978-1-4008-3938-4. MR 2858033..
  81. ^ Sloane, N. J. A. (ed.). "Sequence A090788 (Numbers that can be expressed as the difference of the squares of primes in just two distinct ways.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-03.
  82. ^ 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.
  83. ^ Sloane, N. J. A. (ed.). "Sequence A217843 (Numbers which are the sum of one or more consecutive nonnegative cubes.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-30.
  84. ^ Sloane, N. J. A. (ed.). "Sequence A001694 (Powerful numbers, definition (1): if a prime p divides n then p^2 must also divide n (also called squareful, square full, square-full or 2-powerful numbers).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-30.
  85. ^ Sloane, N. J. A. (ed.). "Sequence A052486 (Achilles numbers - powerful but imperfect: if n equal to Product(p_i^e_i) then all e_i less than 1 (i.e., powerful), but the highest common factor of the e_i is 1, i.e., not a perfect power.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-29.
  86. ^ 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.
  87. ^ a b c 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.
  88. ^ 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)
  89. ^ 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.
  90. ^ Sloane, N. J. A. (ed.). "Sequence A232545 (Number of Euler tours of the complete digraph on n vertices.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  91. ^ Sloane, N. J. A. (ed.). "Sequence A027683 (Number of independent vertex sets of the n X n torus grid graph.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-15.
  92. ^ Sloane, N. J. A. (ed.). "Sequence A027624 (Number of independent vertex sets in the n-hypercube graph Q_n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-15.
  93. ^ Sloane, N. J. A. (ed.). "Sequence A198303 (Irregular triangle C(n,g) counting connected trivalent simple graphs on 2n vertices with girth exactly g.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-15.
  94. ^ Sloane, N. J. A. (ed.). "Sequence A186734 (Triangular array C(n,k) counting connected k-regular simple graphs on n vertices with girth exactly 4.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-15.
  95. ^ Sloane, N. J. A. (ed.). "Sequence A006924 (Number of connected trivalent graphs with 2n nodes and girth exactly 4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  96. ^ 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.
  97. ^ Sloane, N. J. A. (ed.). "Sequence A004009 (Expansion of Eisenstein series E_4(q) (alternate convention E_2(q)); theta series of E_8 lattice.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-10-05.
  98. ^ Sloane, N. J. A. (ed.). "Sequence A013973 (Expansion of Eisenstein series E_6(q) (alternate convention E_3(q)).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-10-05.
  99. ^ Sloane, N. J. A. (ed.). "Sequence A006352 (Coefficients in expansion of Eisenstein series E_2 (also called E_1 or G_2).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-10-05.
  100. ^ Hartshorne, Robin (1977). "Chapter 4: Curves". Algebraic Geometry. Graduate Texts in Mathematics. Vol. 52. Berlin: Springer-Verlag. pp. 316–321. doi:10.1007/978-1-4757-3849-0. ISBN 978-1-4419-2807-8. MR 1567149. OCLC 13348052. S2CID 5695770. Zbl 0367.14001.
  101. ^ 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.
  102. ^ 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.
  103. ^ a b c Ronan, Mark (2006). Symmetry and the Monster: One of the Greatest Quests of Mathematics. New York: Oxford University Press. pp. 1–255. ISBN 978-0-19-280722-9. MR 2215662. OCLC 180766312. Zbl 1113.00002.
  104. ^ Ronan, Mark (6 March 2013). "163 and the Monster". Mark Ronan. Retrieved 2023-08-17.
  105. ^ a b Jansen, Christoph (2005). "The Minimal Degrees of Faithful Representations of the Sporadic Simple Groups and their Covering Groups". LMS Journal of Computation and Mathematics. 8. London: London Mathematical Society: 122−123. doi:10.1112/S1461157000000930. MR 2153793. S2CID 121362819. Zbl 1089.20006.
  106. ^ Griess, Jr., Robert L. (1982). "The Friendly Giant". Inventiones Mathematicae. 69: 91−96. Bibcode:1982InMat..69....1G. doi:10.1007/BF01389186. hdl:2027.42/46608. MR 0671653. S2CID 123597150. Zbl 0498.20013.
  107. ^ Ogg, A. P. (1981). "Modular Functions". In Cooperstein, Bruce; Mason, Geoffrey (eds.). The Santa Cruz Conference on Finite Groups. Proceedings of Symposia in Pure Mathematics. Vol. 37. Providence, RI: American Mathematical Society. pp. 521–532. doi:10.1090/PSPUM/037. ISBN 0-8218-1440-0. MR 0604631. Zbl 0443.00007.
  108. ^ Sloane, N. J. A. (ed.). "Sequence A002267 (The 15 supersingular primes: primes dividing order of Monster simple group.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-09-26.
  109. ^ a b 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.
  110. ^ Weisstein, Eric W. "Almost integer". MathWorld -- A WolframAlpha Resource. Retrieved 2023-10-18.
    The list below gives numbers of the form xeπn for n ≤ 1000 for which |nint(x) − x| ≤ 10−3.
    n |nint(x) − x|
    25 −0.00066
    37 −0.000022
    43 −0.00022
    58 −1.8×10−7
    67 −1.3×10−6
    74 −0.00083
    148 0.00097
    163 −7.5×10−13
    232 −7.8×10−6
    268 0.00029
    522 −0.00015
    652 1.6×10−10
    719 −0.000013
  111. ^ a b Sloane, N. J. A. (ed.). "Sequence A014603 (Discriminants of imaginary quadratic fields with class number 2 (negated).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-10-18.
  112. ^ Sloane, N. J. A. (ed.). "Sequence A032354 (j-invariants for orders of class number 1.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-10-26.
  113. ^ Zagier, Don (2008). "Elliptic Modular Forms and Their Applications". In Ranestad, Kristian (ed.). The 1-2-3 of Modular Forms. Universitext (1st ed.). Berlin: Springer-Verlag. pp. 70−71. doi:10.1007/978-3-540-74119-0_1. ISBN 978-3-540-74117-6. MR 2409678. OCLC 173239471. Zbl 1259.11042.
  114. ^ Arpin, Sarah; Camacho-Navarro, Catalina; et al. (2021). "Adventures in Supersingularland". Experimental Mathematics. 32 (2). Oxfordshire, UK: Taylor & Francis: 245−256. arXiv:1909.07779. Bibcode:2019arXiv190907779A. doi:10.1080/10586458.2021.1926009. MR 4592945. S2CID 202583238. Zbl 1517.94057.
  115. ^ a b Weisstein, Eric W. (2003). Weisstein, Eric W. (ed.). CRC Concise Encyclopedia of Mathematics (2nd ed.). Boca Raton, FL: Chapman & Hall/CRC. pp. 57–59. doi:10.1201/9781420035223. ISBN 9781584883470. JSTOR 20453513. MR 1944431. OCLC 50252094. S2CID 116679721. Zbl 1079.00009.
  116. ^ Sloane, N. J. A. (ed.). "Sequence A329191 (The prime divisors of the orders of the sporadic finite simple groups.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-09.
  117. ^ Sloane, N. J. A. (ed.). "Sequence A113907 (Dimensions of the five sporadic Lie groups.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-09.
  118. ^ Sloane, N. J. A. (ed.). "Sequence A048050 (Chowla's function: sum of divisors of n except for 1 and n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-09.
  119. ^ Sloane, N. J. A. (ed.). "Sequence A006203 (Discriminants of imaginary quadratic fields with class number 3 (negated).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-10-23.
  120. ^ Sloane, N. J. A. (ed.). "Sequence A005250 (Record gaps between primes.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-11.
  121. ^ Sloane, N. J. A. (ed.). "Sequence A005669 (Indices of primes where largest gap occurs.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-11.
  122. ^ Sloane, N. J. A. (ed.). "Sequence A001223 (Prime gaps: differences between consecutive primes.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-11.
  123. ^ Sloane, N. J. A. (ed.). "Sequence A002386 (Primes (lower end) with record gaps to the next consecutive prime: primes p(k) where p(k+1) - p(k) exceeds p(j+1) - p(j) for all j < k.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-11.
  124. ^ Sloane, N. J. A. (ed.). "Sequence A000101 (Record gaps between primes (upper end) (compare A002386, which gives lower ends of these gaps).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-11.
  125. ^ a b Sloane, N. J. A. (ed.). "Sequence A028442 (Numbers k such that Mertens's function M(k) (A002321) is zero.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-09-24.
  126. ^ Watkins, Mark (2004). "Class numbers of imaginary quadratic fields". Mathematics of Computation. 73 (246). Providence, RI: American Mathematical Society: 907–938. doi:10.1090/S0025-5718-03-01517-5. JSTOR 4099810. MR 2031415. Zbl 1050.11095.
  127. ^ Sloane, N. J. A. (ed.). "Sequence A038552 (Largest squarefree number k such that Q(sqrt(-k)) has class number n.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-10-23.
  128. ^ Sloane, N. J. A. (ed.). "Sequence A127106 (Numbers n such that n^2 divides 6^n-1.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-14.
  129. ^ Sloane, N. J. A. (ed.). "Sequence A013658 (Discriminants of imaginary quadratic fields with class number 4 (negated).)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-14.
  130. ^ 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.
  131. ^ 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.
  132. ^ 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.
  133. ^ 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.
  134. ^ 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.
  135. ^ 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.
  136. ^ 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.
  137. ^ 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.
  138. ^ 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.
  139. ^ 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.
  140. ^ 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.
  141. ^ 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.
  142. ^ 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.
  143. ^ a b 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.
  144. ^ a b 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.
  145. ^ a b c Sloane, N. J. A. (ed.). "Sequence A004013 (Theta series of body-centered cubic (b.c.c.) lattice.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-28.
  146. ^ a b Sloane, N. J. A. (ed.). "Sequence A004014 (Norms of vectors in the b.c.c. lattice.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-28.
  147. ^ a b Sloane, N. J. A. (ed.). "Sequence A000118 (Number of ways of writing n as a sum of 4 squares; also theta series of four-dimensional cubic lattice Z^4.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-12-23.
  148. ^ a b Coxeter, H. S. M. (1948). Regular Polytopes (1st ed.). London: Methuen & Co. pp. 1–321. ISBN 9780521201254. MR 0027148. OCLC 472190910.
  149. ^ Pekonen, Osmo (2018). "Which Integer Is the Most Mysterious?". In Sarhangi, Reza (ed.). Bridges: Mathematics, Art, Music, Architecture, Education, Culture. Proceedings of the Bridges Conference. p. 441. ISBN 9781938664274. ISSN 1590-5896. OCLC 7788577569. S2CID 133028298.
  150. ^ He, Yang-Hui; McKay, John (2015). "Sporadic and Exceptional". pp. 1–49. arXiv:1505.06742 [math.AG]. S2CID 117030188.
    "Of particular curiosity is the less well-known fact – in parallel to the above identity – that the constant term of the j-invariant, viz., 744, satisfies 744 = 3 × 248. The number 248 is, of course, the dimension of the adjoint of the largest exceptional algebra [𝖊8]. In fact, that j should encode the presentations of [𝖊8] was settled long before the final proof of the Moonshine conjectures. This relationship between the largest sporadic group and the largest exceptional algebra would connect the McKay Correspondence to Moonshine and thereby weave another beautiful thread into the panoramic tapestry of mathematics.": 4 
    "16 Incidentally, the reader is also alerted to the curiosity that σ1(240) = 744.": 21 (note) 
  151. ^ Sloane, N. J. A. (ed.). "Sequence A007245 (McKay-Thompson series of class 3C for the Monster group.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-10-05.
    j(𝜏)1/3 = q −1/3 (1 + 248q + 4124q2 + 34752q3 + ...)
  152. ^ a b Gannon, Terry (2006). "Introduction: glimpses of the theory beneath Monstrous Moonshine" (PDF). Moonshine beyond the monster: The bridge connecting algebra, modular forms and physics. Cambridge Monographs on Mathematical Physics. Cambridge, MA: Cambridge University Press. pp. 1–15. ISBN 978-0-521-83531-2. MR 2257727. OCLC 1374925688. Zbl 1146.11026.
    "In particular, 4124 = 3875 + 248 + 1 and 34752 = 30380 + 3875 + 2 · 248 + 1, where 248, 3875 and 30380 are all dimensions of irreducible representations of E8().": 6 
  153. ^ 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.
  154. ^ 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.
  155. ^ 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.
  156. ^ 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.
  157. ^ 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.
  158. ^ 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.
  159. ^ Griess, Jr., Robert L.; Lam, Ching Hung (2011). "A moonshine path from E8 to the Monster" (PDF). Journal of Pure and Applied Algebra. 215 (5): 930–931. doi:10.1016/j.jpaa.2010.07.001. MR 2747229. S2CID 123613651. Zbl 1213.17028.
  160. ^ Griess Jr., Robert L.; Lam, Ching Hung (2011). "A moonshine path for 5 A and associated lattices of ranks 8 and 16". Journal of Algebra. 331. Amsterdam: Elsevier: 348. arXiv:1006.3907. Bibcode:2010arXiv1006.3907G. doi:10.1016/j.jalgebra.2010.11.013. MR 2774662. S2CID 119679255. Zbl 1283.20009.
  161. ^ Harada, Masaaki; Lam, Ching Hung; Munemasa, Akihiro (2013). "Residue codes of extremal Type II Z4-codes and the moonshine vertex operator algebra". Mathematische Zeitschrift. 274 (1). Springer: 691, 698–699. arXiv:1005.1144. Bibcode:2010arXiv1005.1144H. doi:10.1007/s00209-012-1091-z. MR 3054350. S2CID 253730965. Zbl 1283.94112.
  162. ^ Pless, V.; Sloane, N. J. A. (1975). "On the classification and enumeration of self-dual codes". Journal of Combinatorial Theory. Series A. 18 (3). Amsterdam: Elsevier: 313–335. doi:10.1016/0097-3165(75)90042-4. MR 0376232. S2CID 16303075. Zbl 0305.94011.
  163. ^ Van Ekeren, Jethro; Lam, Ching Hung; Möller, Sven; Shimakura, Hiroki (2021). "Schellekens' list and the very strange formula". Advances in Mathematics. 380. Amsterdam: Elsevier: 1–34 (107567). arXiv:2005.12248. doi:10.1016/j.aim.2021.107567. MR 4200469. S2CID 218870375. Zbl 1492.17027.
  164. ^ Betsumiya, Koichi; Lam, Ching Hung; Shimakura, Hiroki (2023). "Automorphism Groups and Uniqueness of Holomorphic Vertex Operator Algebras of Central Charge 24". Communications in Mathematical Physics. 399 (3). Berlin: Springer: 1773–1810. arXiv:2203.15992. Bibcode:2023CMaPh.399.1773B. doi:10.1007/s00220-022-04585-6. MR 4580534. S2CID 247793117. Zbl 1523.17056.
  165. ^ Taneja, Inder J. (2016). "Selfie Numbers - IV: Addition, Subtraction and Factorial" (PDF). RGMIA Research Report Collection. 19: 1−4 (Article 163).
  166. ^ 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.
  167. ^ 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.
  168. ^ Sloane, N. J. A. (ed.). "Sequence A000326 (Pentagonal numbers.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-07-16.
  169. ^ 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.
  170. ^ 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.
  171. ^ 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.
  172. ^ 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.
  173. ^ Sloane, N. J. A. (ed.). "Sequence A016073 (Undulating squares.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2023-11-02.
  174. ^ 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.
  175. ^ 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.
  176. ^ Makarova, Natalia V. "Least Magic Squares of Prime Numbers (Part I)". klassikpoez.narod.ru (in Russian). Archived translation in English. Retrieved 2023-12-07.
  177. ^ 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.
  178. ^ 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.
  179. ^ Sloane, N. J. A. (ed.). "Sequence A279019 (Least possible number of diagonals of simple convex polyhedron with n faces.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-10.
  180. ^ 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.
  181. ^ Sloane, N. J. A. (ed.). "Sequence A326118 (a(n) is the largest number of squares of unit area connected only at corners and without holes that can be inscribed in an n X n square.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-01-20.