600 (number)
Appearance
(Redirected from615 (number))
| ||||
---|---|---|---|---|
Cardinal | six hundred | |||
Ordinal | 600th (six hundredth) | |||
Factorization | 23× 3 × 52 | |||
Divisors | 1, 2, 3, 4, 5, 6, 8, 10, 12, 15, 20, 24, 25, 30, 40, 50, 60, 75, 100, 120, 150, 200, 300, 600 | |||
Greek numeral | Χ´ | |||
Roman numeral | DC | |||
Binary | 10010110002 | |||
Ternary | 2110203 | |||
Senary | 24406 | |||
Octal | 11308 | |||
Duodecimal | 42012 | |||
Hexadecimal | 25816 | |||
Armenian | Ո | |||
Hebrew | ת "ר / ם | |||
Babylonian cuneiform | 𒌋 | |||
Egyptian hieroglyph | 𓍧 |
600(six hundred) is thenatural numberfollowing599and preceding601.
Mathematical properties[edit]
Six hundred is acomposite number,anabundant number,apronic number[1]and aHarshad number.
Credit and cars[edit]
- In the United States, acredit scoreof 600 or below is considered poor, limiting available credit at a normal interest rate
- NASCARruns 600 advertised miles in theCoca-Cola 600,its longest race
- TheFiat 600is a car, theSEAT 600its Spanish version
Integers from 601 to 699[edit]
600s[edit]
- 601 = prime number,centered pentagonal number[2]
- 602 = 2 × 7 × 43,nontotient,number of cubes of edge length 1 required to make a hollow cube of edge length 11,area code forPhoenix, AZalong with480and623
- 603 = 32× 67,Harshad number,Riordan number,area codeforNew Hampshire
- 604 = 22× 151,nontotient,totient sum for first 44 integers, area code for southwestern British Columbia (Lower Mainland, Fraser Valley, Sunshine Coast and Sea to Sky)
- 605 = 5 × 112,Harshad number,sum of the nontriangular numbersbetween the two successivetriangular numbers55 and 66,number of non-isomorphic set-systems of weight 9
- 606 = 2 × 3 × 101,sphenic number,sum of six consecutive primes (89 + 97 + 101 + 103 + 107 + 109),admirable number
- 607 – prime number, sum of three consecutive primes (197 + 199 + 211),Mertens function(607) = 0,balanced prime,[3]strictly non-palindromic number,[4]Mersenne primeexponent
- 608 = 25× 19,Mertens function(608) = 0,nontotient,happy number,number of regions formed by drawing the line segments connecting any two of the perimeter points of a 3 times 4 grid of squares[5]
- 609 = 3 × 7 × 29,sphenic number,strobogrammatic number[6]
610s[edit]
- 610 = 2 × 5 × 61, sphenic number,Fibonacci number,[7]Markov number,[8]also a kind oftelephone wall socketused inAustralia
- 611 = 13 × 47, sum of the three standard board sizes in Go (92+ 132+ 192), the611thtribonacci numberis prime
- 612 = 22× 32× 17,Harshad number,Zuckerman number (sequenceA007602in theOEIS),untouchable number,area code forMinneapolis, MN
- 613= prime number, first number ofprime triple(p,p+ 4,p+ 6), middle number ofsexy primetriple (p− 6,p,p+ 6). Geometrical numbers:Centered square numberwith 18 per side,circular numberof 21 with a square grid and 27 using a triangular grid. Also 17-gonal. Hypotenuse of a right triangle with integral sides, these being 35 and 612. Partitioning: 613 partitions of 47 into non-factor primes, 613 non-squashing partitions into distinct parts of the number 54. Squares: Sum of squares of two consecutive integers, 17 and 18. Additional properties: alucky number,index of prime Lucas number.[9]
- InJudaismthe number 613 is very significant, as its metaphysics, theKabbalah,views every complete entity as divisible into 613 parts: 613 parts of everySefirah;613 mitzvot,or divineCommandmentsin theTorah;613 parts of the human body.
- The number 613 hangs from the rafters atMadison Square Gardenin honor ofNew York KnickscoachRed Holzman's 613 victories
- 614 = 2 × 307,nontotient,2-Knödel number.According to RabbiEmil Fackenheim,the number of Commandments in Judaism should be 614 rather than the traditional 613.
- 615 = 3 × 5 × 41,sphenic number
- 616= 23× 7 × 11,Padovan number,balanced number,[10]an alternative value for theNumber of the Beast(more commonly accepted to be666)
- 617 = prime number, sum of five consecutive primes (109 + 113 + 127 + 131 + 137),Chen prime,Eisenstein primewith no imaginary part, number of compositions of 17 into distinct parts,[11]prime index prime,index of prime Lucas number[9]
- Area code 617,a telephone area code covering the metropolitan Boston area
- 618 = 2 × 3 × 103,sphenic number,admirable number
- 619 = prime number,strobogrammatic prime,[12]alternating factorial[13]
620s[edit]
- 620 = 22× 5 × 31, sum of four consecutive primes (149 + 151 + 157 + 163), sum of eight consecutive primes (61 + 67 + 71 + 73 + 79 + 83 + 89 + 97), the sum of the first 620 primes is itself prime[14]
- 621 = 33× 23, Harshad number, the discriminant of a totally real cubic field[15]
- 622 = 2 × 311,nontotient,Fine number,Fine's sequence (or Fine numbers): number of relations of valence >= 1 on an n-set; also number of ordered rooted trees with n edges having root of even degree,it is also the standard diameter of modern roadbicycle wheels(622 mm, from hook bead to hook bead)
- 623 = 7 × 89, number of partitions of 23 into an even number of parts[16]
- 624 = 24× 3 × 13 =J4(5),[17]sum of a twin prime (311 + 313), Harshad number, Zuckerman number
- 625 = 252= 54,sum of seven consecutive primes (73 + 79 + 83 + 89 + 97 + 101 + 103),centered octagonal number,[18]1-automorphic number,Friedman numbersince 625 = 56−2,[19]one of the two three-digit numbers when squared or raised to a higher power that end in the same three digits, the other being376
- 626 = 2 × 313,nontotient,2-Knödel number,Stitch's experiment number
- 627 = 3 × 11 × 19, sphenic number, number ofinteger partitionsof 20,[20]Smith number[21]
- 628 = 22× 157,nontotient,totient sum for first 45 integers
- 629 = 17 × 37,highly cototient number,[22]Harshad number,number of diagonals in a 37-gon[23]
630s[edit]
- 630 = 2 × 32× 5 × 7, sum of six consecutive primes (97 + 101 + 103 + 107 + 109 + 113),triangular number,hexagonal number,[24]sparsely totient number,[25]Harshad number, balanced number[26]
- 631 =Cuban primenumber,Lucky prime,centered triangular number,[27]centered hexagonal number,[28]Chen prime, lazy caterer number (sequenceA000124in theOEIS)
- 632 = 23× 79,refactorable number,number of 13-bead necklaces with 2 colors[29]
- 633 = 3 × 211, sum of three consecutive primes (199 + 211 + 223),Blum integer;also, in the title of the movie633 Squadron
- 634 = 2 × 317,nontotient,Smith number[21]
- 635 = 5 × 127, sum of nine consecutive primes (53 + 59 + 61 + 67 + 71 + 73 + 79 + 83 + 89), Mertens function(635) = 0, number of compositions of 13 into pairwise relatively prime parts[30]
- 636 = 22× 3 × 53, sum of ten consecutive primes (43 + 47 + 53 + 59 + 61 + 67 + 71 + 73 + 79 + 83), Smith number,[21]Mertens function(636) = 0
- 637 = 72× 13, Mertens function(637) = 0,decagonal number[31]
- 638 = 2 × 11 × 29, sphenic number, sum of four consecutive primes (151 + 157 + 163 + 167),nontotient,centered heptagonal number[32]
- 639 = 32× 71, sum of the first twenty primes, alsoISO 639is theISO's standard for codes for the representation oflanguages
640s[edit]
- 640 = 27× 5,Harshad number,refactorable number,hexadecagonal number,[33]number of 1's in all partitions of 24 into odd parts,[34]number of acres in a square mile
- 641 = prime number,Sophie Germain prime,[35]factor of4294967297(the smallest nonprimeFermat number), Chen prime, Eisenstein prime with no imaginary part,Proth prime[36]
- 642 = 2 × 3 × 107 = 14+ 24+ 54,[37]sphenic number,admirable number
- 643 = prime number, largest prime factor of 123456
- 644 = 22× 7 × 23,nontotient,Perrin number,[38]Harshad number, commonumask,admirable number
- 645 = 3 × 5 × 43, sphenic number,octagonal number,Smith number,[21]Fermat pseudoprimeto base 2,[39]Harshad number
- 646 = 2 × 17 × 19, sphenic number, alsoISO 646is the ISO's standard for international 7-bit variants ofASCII,number of permutations of length 7 without rising or falling successions[40]
- 647 = prime number, sum of five consecutive primes (113 + 127 + 131 + 137 + 139), Chen prime, Eisenstein prime with no imaginary part, 3647- 2647is prime[41]
- 648 = 23× 34=A331452(7, 1),[5]Harshad number,Achilles number,area of a square with diagonal 36[42]
- 649 = 11 × 59,Blum integer
650s[edit]
- 650 = 2 × 52× 13,primitive abundant number,[43]square pyramidal number,[44]pronic number,[1]nontotient,totient sum for first 46 integers; (other fields)the number of seats in theHouse of Commons of the United Kingdom,admirable number
- 651 = 3 × 7 × 31, sphenic number,pentagonal number,[45]nonagonal number[46]
- 652 = 22× 163, maximal number of regions by drawing 26 circles[47]
- 653 = prime number, Sophie Germain prime,[35]balanced prime,[3]Chen prime, Eisenstein prime with no imaginary part
- 654 = 2 × 3 × 109, sphenic number,nontotient,Smith number,[21]admirable number
- 655 = 5 × 131, number of toothpicks after 20 stages in a three-dimensional grid[48]
- 656 = 24× 41 =,[49]inJudaism,656 is the number of times thatJerusalemis mentioned in theHebrew BibleorOld Testament
- 657 = 32× 73, the largest known number not of the forma2+swithsasemiprime
- 658 = 2 × 7 × 47,sphenic number,untouchable number
- 659 = prime number, Sophie Germain prime,[35]sum of seven consecutive primes (79 + 83 + 89 + 97 + 101 + 103 + 107), Chen prime, Mertens function sets new low of −10 which stands until 661, highly cototient number,[22]Eisenstein prime with no imaginary part, strictly non-palindromic number[4]
660s[edit]
- 660 = 22× 3 × 5 × 11
- Sum of four consecutive primes (157 + 163 + 167 + 173)
- Sum of six consecutive primes (101 + 103 + 107 + 109 + 113 + 127)
- Sum of eight consecutive primes (67 + 71 + 73 + 79 + 83 + 89 + 97 + 101)
- Sparsely totient number[25]
- Sum of 11th row when writing the natural numbers as a triangle.[50]
- Harshad number.
- 661 = prime number
- Sum of three consecutive primes (211 + 223 + 227)
- Mertens function sets new low of −11 which stands until 665
- Pentagramnumber of the form
- Hexagramnumber of the formi.e. astar number
- 662 = 2 × 331,nontotient,member ofMian–Chowla sequence[51]
- 663 = 3 × 13 × 17,sphenic number,Smith number[21]
- 664 = 23× 83,refactorable number,number of knapsack partitions of 33[52]
- Telephonearea code for Montserrat
- Area code for Tijuanawithin Mexico
- Model number for theAmstrad CPC 664home computer
- 665 = 5 × 7 × 19,sphenic number,Mertens function sets new low of −12 which stands until 1105, number of diagonals in a 38-gon[23]
- 666= 2 × 32× 37,Harshad number,repdigit
- 667 = 23 × 29, lazy caterer number (sequenceA000124in theOEIS)
- 668 = 22× 167,nontotient
- 669 = 3 × 223,blum integer
670s[edit]
- 670 = 2 × 5 × 67, sphenic number,octahedral number,[53]nontotient
- 671 = 11 × 61. This number is themagic constantofn×nnormalmagic squareandn-queens problemforn= 11.
- 672 = 25× 3 × 7,harmonic divisor number,[54]Zuckerman number,admirable number
- 673 = prime number, lucky prime, Proth prime[36]
- 674 = 2 × 337,nontotient,2-Knödel number
- 675 = 33× 52,Achilles number
- 676 = 22× 132= 262,palindromic square
- 677 = prime number, Chen prime, Eisenstein prime with no imaginary part, number of non-isomorphic self-dual multiset partitions of weight 10[55]
- 678 = 2 × 3 × 113, sphenic number,nontotient,number of surface points of an octahedron with side length 13,[56]admirable number
- 679 = 7 × 97, sum of three consecutive primes (223 + 227 + 229), sum of nine consecutive primes (59 + 61 + 67 + 71 + 73 + 79 + 83 + 89 + 97), smallest number of multiplicative persistence 5[57]
680s[edit]
- 680 = 23× 5 × 17,tetrahedral number,[58]nontotient
- 681 = 3 × 227, centered pentagonal number[2]
- 682 = 2 × 11 × 31, sphenic number, sum of four consecutive primes (163 + 167 + 173 + 179), sum of ten consecutive primes (47 + 53 + 59 + 61 + 67 + 71 + 73 + 79 + 83 + 89), number of moves to solve the Norwegian puzzlestrikketoy[59]
- 683 = prime number, Sophie Germain prime,[35]sum of five consecutive primes (127 + 131 + 137 + 139 + 149), Chen prime, Eisenstein prime with no imaginary part,Wagstaff prime[60]
- 684 = 22× 32× 19, Harshad number, number of graphical forest partitions of 32[61]
- 685 = 5 × 137, centered square number[62]
- 686 = 2 × 73,nontotient,number of multigraphs on infinite set of nodes with 7 edges[63]
- 687 = 3 × 229, 687 days to orbit the Sun (Mars)D-number[64]
- 688 = 24× 43, Friedman number since 688 = 8 × 86,[19]2-automorphic number[65]
- 689 = 13 × 53, sum of three consecutive primes (227 + 229 + 233), sum of seven consecutive primes (83 + 89 + 97 + 101 + 103 + 107 + 109).Strobogrammatic number[66]
690s[edit]
- 690 = 2 × 3 × 5 × 23, sum of six consecutive primes (103 + 107 + 109 + 113 + 127 + 131), sparsely totient number,[25]Smith number,[21]Harshad number
- ISO 690is the ISO's standard for bibliographic references
- 691 = prime number, (negative) numerator of theBernoulli numberB12= -691/2730.Ramanujan's tau functionτ and thedivisor functionσ11are related by the remarkable congruence τ(n) ≡ σ11(n) (mod 691).
- In number theory, 691 is a "marker" (similar to the radioactive markers in biology): whenever it appears in a computation, one can be sure that Bernoulli numbers are involved.
- 692 = 22× 173, number of partitions of 48 into powers of 2[67]
- 693= 32× 7 × 11, triangular matchstick number,[68]the number of sections inLudwig Wittgenstein'sPhilosophical Investigations.
- 694 = 2 × 347, centered triangular number,[27]nontotient,smallest pandigital number in base 5.[69]
- 695 = 5 × 139, 695!! + 2 is prime.[70]
- 696 = 23× 3 × 29, sum of a twin prime (347 + 349) sum of eight consecutive primes (71 + 73 + 79 + 83 + 89 + 97 + 101 + 103), totient sum for first 47 integers, trails of length 9 on honeycomb lattice[71]
- 697 = 17 × 41,cake number;the number of sides of Colorado[72]
- 698 = 2 × 349,nontotient,sum of squares of two primes[73]
- 699 = 3 × 233,D-number[64]
References[edit]
- ^abSloane, N. J. A.(ed.)."Sequence A002378 (Oblong (or promic, pronic, or heteromecic) numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^abSloane, N. J. A.(ed.)."Sequence A005891 (Centered pentagonal numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^abSloane, N. J. A.(ed.)."Sequence A006562 (Balanced primes)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^abSloane, N. J. A.(ed.)."Sequence A016038 (Strictly non-palindromic numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^abSloane, N. J. A.(ed.)."Sequence A331452 (Triangle read by rows: T(n,m) (n >= m >= 1) = number of regions (or cells) formed by drawing the line segments connecting any two of the 2*(m+n) perimeter points of an m X n grid of squares)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A000787 (Strobogrammatic numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A000045 (Fibonacci numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A002559 (Markoff (or Markov) numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^abSloane, N. J. A.(ed.)."Sequence A001606 (Indices of prime Lucas numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A020492 (Balanced numbers: numbers k such that phi(k) (A000010) divides sigma(k) (A000203))".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A032020 (Number of compositions (ordered partitions) of n into distinct parts)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-24.
- ^Sloane, N. J. A.(ed.)."Sequence A007597 (Strobogrammatic primes)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A005165 (Alternating factorials)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^OEIS:A013916
- ^Sloane, N. J. A.(ed.)."Sequence A006832 (Discriminants of totally real cubic fields)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A027187 (Number of partitions of n into an even number of parts)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A059377 (Jordan function J_4(n))".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A016754 (Odd squares: a(n) = (2n+1)^2. Also centered octagonal numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^abSloane, N. J. A.(ed.)."Sequence A036057 (Friedman numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A000041 (a(n) = number of partitions of n)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^abcdefgSloane, N. J. A.(ed.)."Sequence A006753 (Smith numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^abSloane, N. J. A.(ed.)."Sequence A100827 (Highly cototient numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^abSloane, N. J. A.(ed.)."Sequence A000096 (a(n) = n*(n+3)/2)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A000384 (Hexagonal numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^abcSloane, N. J. A.(ed.)."Sequence A036913 (Sparsely totient numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A020492 (Balanced numbers: numbers k such that phi(k) (A000010) divides sigma(k) (A000203))".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^abSloane, N. J. A.(ed.)."Sequence A005448 (Centered triangular numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A003215 (Hex (or centered hexagonal) numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A000031 (Number of n-bead necklaces with 2 colors when turning over is not allowed; also number of output sequences from a simple n-stage cycling shift register; also number of binary irreducible polynomials whose degree divides n)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A101268 (Number of compositions of n into pairwise relatively prime parts)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-31.
- ^Sloane, N. J. A.(ed.)."Sequence A001107 (10-gonal (or decagonal) numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A069099 (Centered heptagonal numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A051868 (16-gonal (or hexadecagonal) numbers: a(n) = n*(7*n-6))".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A036469 (Partial sums of A000009 (partitions into distinct parts))".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^abcdSloane, N. J. A.(ed.)."Sequence A005384 (Sophie Germain primes)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^abSloane, N. J. A.(ed.)."Sequence A080076 (Proth primes)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A074501 (a(n) = 1^n + 2^n + 5^n)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-31.
- ^"Sloane's A001608: Perrin sequence".The On-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A001567 (Fermat pseudoprimes to base 2)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A002464 (Hertzsprung's problem: ways to arrange n non-attacking kings on an n X n board, with 1 in each row and column. Also number of permutations of length n without rising or falling successions)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A057468 (Numbers k such that 3^k - 2^k is prime)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A001105 (a(n) = 2*n^2)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A071395 (Primitive abundant numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A000330 (Square pyramidal numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A000326 (Pentagonal numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A001106 (9-gonal (or enneagonal or nonagonal) numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A014206 (a(n) = n^2 + n + 2)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A160160 (Toothpick sequence in the three-dimensional grid)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A002379 (a(n) = floor(3^n / 2^n))".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A027480 (a(n) = n*(n+1)*(n+2)/2)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A005282 (Mian-Chowla sequence)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A108917 (Number of knapsack partitions of n)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A005900 (Octahedral numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A001599 (Harmonic or Ore numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A316983 (Number of non-isomorphic self-dual multiset partitions of weight n)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A005899 (Number of points on surface of octahedron with side n)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-31.
- ^Sloane, N. J. A.(ed.)."Sequence A003001 (Smallest number of multiplicative persistence n)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-31.
- ^Sloane, N. J. A.(ed.)."Sequence A000292 (Tetrahedral numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A000975 (Lichtenberg sequence)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-31.
- ^Sloane, N. J. A.(ed.)."Sequence A000979 (Wagstaff primes)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A000070 (a(n) = Sum_{k=0..n} p(k) where p(k) = number of partitions of k (A000041))".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-31.
- ^Sloane, N. J. A.(ed.)."Sequence A001844 (Centered square numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2016-06-11.
- ^Sloane, N. J. A.(ed.)."Sequence A050535 (Number of multigraphs on infinite set of nodes with n edges)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-31.
- ^abSloane, N. J. A.(ed.)."Sequence A033553 (3-Knödel numbers or D-numbers: numbers n > 3 such that n divides k^(n-2)-k for all k with gcd(k, n) = 1)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-31.
- ^Sloane, N. J. A.(ed.)."Sequence A030984 (2-automorphic numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2021-09-01.
- ^Sloane, N. J. A.(ed.)."Sequence A000787 (Strobogrammatic numbers)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A000123 (Number of binary partitions: number of partitions of 2n into powers of 2)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-31.
- ^Sloane, N. J. A.(ed.)."Sequence A045943 (Triangular matchstick numbers: a(n) = 3*n*(n+1)/2)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-31.
- ^Sloane, N. J. A.(ed.)."Sequence A049363 (a(1) = 1; for n > 1, smallest digitally balanced number in base n)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.
- ^Sloane, N. J. A.(ed.)."Sequence A076185 (Numbers n such that n!! + 2 is prime)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-31.
- ^Sloane, N. J. A.(ed.)."Sequence A006851 (Trails of length n on honeycomb lattice)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.Retrieved2022-05-18.
- ^"Colorado is a rectangle? Think again".23 January 2023.
- ^Sloane, N. J. A.(ed.)."Sequence A045636 (Numbers of the form p^2 + q^2, with p and q primes)".TheOn-Line Encyclopedia of Integer Sequences.OEIS Foundation.