Home  

Random  

Nearby  



Log in  



Settings  



Donate  



About Wikipedia  

Disclaimers  



Wikipedia





300 (number)





Article  

Talk  



Language  

Watch  

Edit  


(Redirected from 316 (number))
 


300 (three hundred) is the natural number following 299 and preceding 301.

← 299 300 301 →

  • Integers
  • 0 100 200 300 400 500 600 700 800 900

    Cardinalthree hundred
    Ordinal300th
    (three hundredth)
    Factorization22 × 3 × 52
    Greek numeralΤ´
    Roman numeralCCC
    Binary1001011002
    Ternary1020103
    Senary12206
    Octal4548
    Duodecimal21012
    Hexadecimal12C16
    Hebrewש
    ArmenianՅ
    Babylonian cuneiform𒐙
    Egyptian hieroglyph𓍤

    Mathematical properties

    edit

    The number 300 is the 24th triangular number, with factorization 22 × 3 × 52.

    It is the sum of a pair of twin primes, as well as a sum of ten consecutive primes:

     

    Also, 30064 + 1 is prime.

    300 is palindromic in three consecutive bases: 30010 = 6067 = 4548 = 3639, and also in base 13.

    300 is the eighth term in the Engel expansionofpi,[1] following 19 and preceding 1991.

    Integers from 301 to 399

    edit

    300s

    edit

    301

    edit

    302

    edit

    303

    edit

    304

    edit

    305

    edit

    306

    edit

    307

    edit

    308

    edit

    309

    edit

    309 = 3 × 103, Blum integer, number of primes <= 211.[2]

    310s

    edit

    310

    edit

    311

    edit

    312

    edit

    312 = 23 × 3 × 13, idoneal number.[3]

    313

    edit

    314

    edit

    314 = 2 × 157. 314 is a nontotient,[4] smallest composite number in Somos-4 sequence.[5]

    315

    edit

    315 = 32 × 5 × 7 =   rencontres number, highly composite odd number, having 12 divisors.[6]

    316

    edit

    316 = 22 × 79, a centered triangular number[7] and a centered heptagonal number.[8]

    317

    edit

    317 is a prime number, Eisenstein prime with no imaginary part, Chen prime,[9] one of the rare primes to be both right and left-truncatable,[10] and a strictly non-palindromic number.

    317 is the exponent (and number of ones) in the fourth base-10 repunit prime.[11]

    318

    edit

    319

    edit

    319 = 11 × 29. 319 is the sum of three consecutive primes (103 + 107 + 109), Smith number,[12] cannot be represented as the sum of fewer than 19 fourth powers, happy number in base 10[13]

    320s

    edit

    320

    edit

    320 = 26 × 5 = (25) × (2 × 5). 320 is a Leyland number,[14] and maximum determinant of a 10 by 10 matrix of zeros and ones.

    321

    edit

    321 = 3 × 107, a Delannoy number[15]

    322

    edit

    322 = 2 × 7 × 23. 322 is a sphenic,[16] nontotient, untouchable,[17] and a Lucas number.[18]

    323

    edit

    323 = 17 × 19. 323 is the sum of nine consecutive primes (19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53), the sum of the 13 consecutive primes (5 + 7 + 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47), Motzkin number.[19] A Lucas and Fibonacci pseudoprime. See 323 (disambiguation)

    324

    edit

    324 = 22 × 34 = 182. 324 is the sum of four consecutive primes (73 + 79 + 83 + 89), totient sum of the first 32 integers, a square number,[20] and an untouchable number.[17]

    325

    edit

    325 = 52 × 13. 325 is a triangular number, hexagonal number,[21] nonagonal number,[22] centered nonagonal number.[23] 325 is the smallest number to be the sum of two squares in 3 different ways: 12 + 182, 62 + 172 and 102 + 152. 325 is also the smallest (and only known) 3-hyperperfect number.[24][25]

    326

    edit

    326 = 2 × 163. 326 is a nontotient, noncototient,[26] and an untouchable number.[17] 326 is the sum of the 14 consecutive primes (3 + 5 + 7 + 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47), lazy caterer number[27]

    327

    edit

    327 = 3 × 109. 327 is a perfect totient number,[28] number of compositions of 10 whose run-lengths are either weakly increasing or weakly decreasing[29]

    328

    edit

    328 = 23 × 41. 328 is a refactorable number,[30] and it is the sum of the first fifteen primes (2 + 3 + 5 + 7 + 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47).

    329

    edit

    329 = 7 × 47. 329 is the sum of three consecutive primes (107 + 109 + 113), and a highly cototient number.[31]

    330s

    edit

    330

    edit

    330 = 2 × 3 × 5 × 11. 330 is sum of six consecutive primes (43 + 47 + 53 + 59 + 61 + 67), pentatope number (and hence a binomial coefficient  ), a pentagonal number,[32] divisible by the number of primes below it, and a sparsely totient number.[33]

    331

    edit

    331 is a prime number, super-prime, cuban prime,[34]alucky prime,[35] sum of five consecutive primes (59 + 61 + 67 + 71 + 73), centered pentagonal number,[36] centered hexagonal number,[37] and Mertens function returns 0.[38]

    332

    edit

    332 = 22 × 83, Mertens function returns 0.[38]

    333

    edit

    333 = 32 × 37, Mertens function returns 0;[38] repdigit; 2333 is the smallest power of two greater than a googol.

    334

    edit

    334 = 2 × 167, nontotient.[39]

    335

    edit

    335 = 5 × 67. 335 is divisible by the number of primes below it, number of Lyndon words of length 12.

    336

    edit

    336 = 24 × 3 × 7, untouchable number,[17] number of partitions of 41 into prime parts.[40]

    337

    edit

    337, prime number, emirp, permutable prime with 373 and 733, Chen prime,[9] star number

    338

    edit

    338 = 2 × 132, nontotient, number of square (0,1)-matrices without zero rows and with exactly 4 entries equal to 1.[41]

    339

    edit

    339 = 3 × 113, Ulam number[42]

    340s

    edit

    340

    edit

    340 = 22 × 5 × 17, sum of eight consecutive primes (29 + 31 + 37 + 41 + 43 + 47 + 53 + 59), sum of ten consecutive primes (17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53), sum of the first four powers of 4 (41 + 42 + 43 + 44), divisible by the number of primes below it, nontotient, noncototient.[26] Number of regions formed by drawing the line segments connecting any two of the 12 perimeter points of a 3 times 3 grid of squares (sequence A331452 in the OEIS) and (sequence A255011 in the OEIS).

    341

    edit

    341 = 11 × 31, sum of seven consecutive primes (37 + 41 + 43 + 47 + 53 + 59 + 61), octagonal number,[43] centered cube number,[44] super-Poulet number. 341 is the smallest Fermat pseudoprime; it is the least composite odd modulus m greater than the base b, that satisfies the Fermat property "bm−1 − 1 is divisible by m", for bases up to 128 of b = 2, 15, 60, 63, 78, and 108.

    342

    edit

    342 = 2 × 32 × 19, pronic number,[45] Untouchable number.[17]

    343

    edit

    343 = 73, the first nice Friedman number that is composite since 343 = (3 + 4)3. It is the only known example of x2+x+1 = y3, in this case, x=18, y=7. It is z3 in a triplet (x,y,z) such that x5 + y2 = z3.

    344

    edit

    344 = 23 × 43, octahedral number,[46] noncototient,[26] totient sum of the first 33 integers, refactorable number.[30]

    345

    edit

    345 = 3 × 5 × 23, sphenic number,[16] idoneal number

    346

    edit

    346 = 2 × 173, Smith number,[12] noncototient.[26]

    347

    edit

    347 is a prime number, emirp, safe prime,[47] Eisenstein prime with no imaginary part, Chen prime,[9] Friedman prime since 347 = 73 + 4, twin prime with 349, and a strictly non-palindromic number.

    348

    edit

    348 = 22 × 3 × 29, sum of four consecutive primes (79 + 83 + 89 + 97), refactorable number.[30]

    349

    edit

    349, prime number, twin prime, lucky prime, sum of three consecutive primes (109 + 113 + 127), 5349 - 4349, [48] is a prime number.

    350s

    edit

    350

    edit

    350 = 2 × 52 × 7 =  , primitive semiperfect number,[49] divisible by the number of primes below it, nontotient, a truncated icosahedron of frequency 6 has 350 hexagonal faces and 12 pentagonal faces.

    351

    edit

    351 = 33 × 13, triangular number, sum of five consecutive primes (61 + 67 + 71 + 73 + 79), member of Padovan sequence[50] and number of compositions of 15 into distinct parts.[51]

    352

    edit

    352 = 25 × 11, the number of n-Queens Problem solutions for n = 9. It is the sum of two consecutive primes (173 + 179), lazy caterer number[27]

    353

    edit

    354

    edit

    354 = 2 × 3 × 59 = 14 + 24 + 34 + 44,[52][53] sphenic number,[16] nontotient, also SMTP code meaning start of mail input. It is also sum of absolute value of the coefficientsofConway's polynomial.

    355

    edit

    355 = 5 × 71, Smith number,[12] Mertens function returns 0,[38] divisible by the number of primes below it.

    The numerator of the best simplified rational approximation of pi having a denominator of four digits or fewer. This fraction (355/113) is known as Milü and provides an extremely accurate approximation for pi.

    356

    edit

    356 = 22 × 89, Mertens function returns 0.[38]

    357

    edit

    357 = 3 × 7 × 17, sphenic number.[16]

    358

    edit

    358 = 2 × 179, sum of six consecutive primes (47 + 53 + 59 + 61 + 67 + 71), Mertens function returns 0,[38] number of ways to partition {1,2,3,4,5} and then partition each cell (block) into subcells.[54]

    359

    edit

    360s

    edit

    360

    edit

    361

    edit

    361 = 192. 361 is a centered triangular number,[7] centered octagonal number, centered decagonal number,[55] member of the Mian–Chowla sequence;[56] also the number of positions on a standard 19 x 19 Go board.

    362

    edit

    362 = 2 × 181 = σ2(19): sum of squares of divisors of 19,[57] Mertens function returns 0,[38] nontotient, noncototient.[26]

    363

    edit

    364

    edit

    364 = 22 × 7 × 13, tetrahedral number,[58] sum of twelve consecutive primes (11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53), Mertens function returns 0,[38] nontotient. It is a repdigit in base 3 (111111), base 9 (444), base 25 (EE), base 27 (DD), base 51 (77) and base 90 (44), the sum of six consecutive powers of 3 (1 + 3 + 9 + 27 + 81 + 243), and because it is the twelfth non-zero tetrahedral number.[58]

    365

    edit

    366

    edit

    366 = 2 × 3 × 61, sphenic number,[16] Mertens function returns 0,[38] noncototient,[26] number of complete partitions of 20,[59] 26-gonal and 123-gonal. Also the number of days in a leap year.

    367

    edit

    367 is a prime number, a lucky prime,[35] Perrin number,[60] happy number, prime index prime and a strictly non-palindromic number.

    368

    edit

    368 = 24 × 23. It is also a Leyland number.[14]

    369

    edit

    370s

    edit

    370

    edit

    370 = 2 × 5 × 37, sphenic number,[16] sum of four consecutive primes (83 + 89 + 97 + 101), nontotient, with 369 part of a Ruth–Aaron pair with only distinct prime factors counted, Base 10 Armstrong number since 33 + 73 + 03 = 370.

    371

    edit

    371 = 7 × 53, sum of three consecutive primes (113 + 127 + 131), sum of seven consecutive primes (41 + 43 + 47 + 53 + 59 + 61 + 67), sum of the primes from its least to its greatest prime factor,[61] the next such composite number is 2935561623745, Armstrong number since 33 + 73 + 13 = 371.

    372

    edit

    372 = 22 × 3 × 31, sum of eight consecutive primes (31 + 37 + 41 + 43 + 47 + 53 + 59 + 61), noncototient,[26] untouchable number,[17] --> refactorable number.[30]

    373

    edit

    373, prime number, balanced prime,[62] one of the rare primes to be both right and left-truncatable (two-sided prime),[10] sum of five consecutive primes (67 + 71 + 73 + 79 + 83), sexy prime with 367 and 379, permutable prime with 337 and 733, palindromic prime in 3 consecutive bases: 5658 = 4549 = 37310 and also in base 4: 113114.

    374

    edit

    374 = 2 × 11 × 17, sphenic number,[16] nontotient, 3744 + 1 is prime.[63]

    375

    edit

    375 = 3 × 53, number of regions in regular 11-gon with all diagonals drawn.[64]

    376

    edit

    376 = 23 × 47, pentagonal number,[32] 1-automorphic number,[65] nontotient, refactorable number.[30] There is a math puzzle in which when 376 is squared, 376 is also the last three digits, as 376 * 376 = 141376 [66]

    377

    edit

    377 = 13 × 29, Fibonacci number, a centered octahedral number,[67] a Lucas and Fibonacci pseudoprime, the sum of the squares of the first six primes.

    378

    edit

    378 = 2 × 33 × 7, triangular number, cake number, hexagonal number,[21] Smith number.[12]

    379

    edit

    379 is a prime number, Chen prime,[9] lazy caterer number[27] and a happy number in base 10. It is the sum of the 15 consecutive primes (3 + 5 + 7 + 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53). 379! - 1 is prime.

    380s

    edit

    380

    edit

    380 = 22 × 5 × 19, pronic number,[45] number of regions into which a figure made up of a row of 6 adjacent congruent rectangles is divided upon drawing diagonals of all possible rectangles.[68]

    381

    edit

    381 = 3 × 127, palindromic in base 2 and base 8.

    381 is the sum of the first 16 prime numbers (2 + 3 + 5 + 7 + 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53).

    382

    edit

    382 = 2 × 191, sum of ten consecutive primes (19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53 + 59), Smith number.[12]

    383

    edit

    383, prime number, safe prime,[47] Woodall prime,[69] Thabit number, Eisenstein prime with no imaginary part, palindromic prime. It is also the first number where the sum of a prime and the reversal of the prime is also a prime.[70] 4383 - 3383 is prime.

    384

    edit

    385

    edit

    385 = 5 × 7 × 11, sphenic number,[16] square pyramidal number,[71] the number of integer partitions of 18.

    385 = 102 + 92 + 82 + 72 + 62 + 52 + 42 + 32 + 22 + 12

    386

    edit

    386 = 2 × 193, nontotient, noncototient,[26] centered heptagonal number,[8] number of surface points on a cube with edge-length 9.[72]

    387

    edit

    387 = 32 × 43, number of graphical partitions of 22.[73]

    388

    edit

    388 = 22 × 97 = solution to postage stamp problem with 6 stamps and 6 denominations,[74] number of uniform rooted trees with 10 nodes.[75]

    389

    edit

    389, prime number, emirp, Eisenstein prime with no imaginary part, Chen prime,[9] highly cototient number,[31] strictly non-palindromic number. Smallest conductor of a rank 2 Elliptic curve.

    390s

    edit

    390

    edit

    390 = 2 × 3 × 5 × 13, sum of four consecutive primes (89 + 97 + 101 + 103), nontotient,

      is prime[76]

    391

    edit

    391 = 17 × 23, Smith number,[12] centered pentagonal number.[36]

    392

    edit

    392 = 23 × 72, Achilles number.

    393

    edit

    393 = 3 × 131, Blum integer, Mertens function returns 0.[38]

    394

    edit

    394 = 2 × 197 = S5aSchröder number,[77] nontotient, noncototient.[26]

    395

    edit

    395 = 5 × 79, sum of three consecutive primes (127 + 131 + 137), sum of five consecutive primes (71 + 73 + 79 + 83 + 89), number of (unordered, unlabeled) rooted trimmed trees with 11 nodes.[78]

    396

    edit

    396 = 22 × 32 × 11, sum of twin primes (197 + 199), totient sum of the first 36 integers, refactorable number,[30] Harshad number, digit-reassembly number.

    397

    edit

    397, prime number, cuban prime,[34] centered hexagonal number.[37]

    398

    edit

    398 = 2 × 199, nontotient.

      is prime[76]

    399

    edit

    399 = 3 × 7 × 19, sphenic number,[16] smallest Lucas–Carmichael number, Leyland number of the second kind. 399! + 1 is prime.

    References

    edit
    1. ^ Sloane, N. J. A. (ed.). "Sequence A006784 (Engel expansion of Pi.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2024-06-14.
  • ^ Sloane, N. J. A. (ed.). "Sequence A007053 (Number of primes <= 2^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A000926 (Euler's "numerus idoneus" (or "numeri idonei", or idoneal, or suitable, or convenient numbers))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A005277 (Nontotients: even numbers k such that phi(m)=k has no solution)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A006720 (Somos-4 sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A053624 (Highly composite odd numbers (1): where d(n) increases to a record)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ a b Sloane, N. J. A. (ed.). "Sequence A005448 (Centered triangular numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ a b Sloane, N. J. A. (ed.). "Sequence A069099 (Centered heptagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ a b c d e Sloane, N. J. A. (ed.). "Sequence A109611 (Chen primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ a b Sloane, N. J. A. (ed.). "Sequence A020994 (Primes that are both left-truncatable and right-truncatable)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Guy, Richard; Unsolved Problems in Number Theory, p. 7 ISBN 1475717385
  • ^ a b c d e f Sloane, N. J. A. (ed.). "Sequence A006753 (Smith numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A007770 (Happy numbers: numbers whose trajectory under iteration of sum of squares of digits map (see A003132) includes 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ a b Sloane, N. J. A. (ed.). "Sequence A076980 (Leyland numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A001850 (Central Delannoy numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ a b c d e f g h i Sloane, N. J. A. (ed.). "Sequence A007304 (Sphenic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ a b c d e f Sloane, N. J. A. (ed.). "Sequence A005114 (Untouchable numbers, also called nonaliquot numbers: impossible values for the sum of aliquot parts function)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A000032 (Lucas numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A001006 (Motzkin numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A000290 (The squares: a(n) = n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ a b Sloane, N. J. A. (ed.). "Sequence A000384 (Hexagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A001106 (9-gonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A060544 (Centered 9-gonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A034897 (Hyperperfect numbers: x such that x = 1 + k*(sigma(x)-x-1) for some k > 0)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A007594 (Smallest n-hyperperfect number: m such that m=n(sigma(m)-m-1)+1; or 0 if no such number exists)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ a b c d e f g h i Sloane, N. J. A. (ed.). "Sequence A005278 (Noncototients)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ a b c Sloane, N. J. A. (ed.). "Sequence A000124 (Central polygonal numbers (the Lazy Caterer's sequence): n(n+1)/2 + 1; or, maximal number of pieces formed when slicing a pancake with n cuts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A082897 (Perfect totient numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A332835 (Number of compositions of n whose run-lengths are either weakly increasing or weakly decreasing)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ a b c d e f Sloane, N. J. A. (ed.). "Sequence A033950 (Refactorable numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ a b Sloane, N. J. A. (ed.). "Sequence A100827 (Highly cototient numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ a b Sloane, N. J. A. (ed.). "Sequence A000326 (Pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A036913 (Sparsely totient numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ a b Sloane, N. J. A. (ed.). "Sequence A002407 (Cuban primes: primes which are the difference of two consecutive cubes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ a b Sloane, N. J. A. (ed.). "Sequence A031157 (Numbers that are both lucky and prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ a b Sloane, N. J. A. (ed.). "Sequence A005891 (Centered pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ a b Sloane, N. J. A. (ed.). "Sequence A003215 (Hex numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ a b c d e f g h i j Sloane, N. J. A. (ed.). "Sequence A028442 (Numbers n such that Mertens' function is zero)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A003052 (Self numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A000607 (Number of partitions of n into prime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A122400 (Number of square (0,1)-matrices without zero rows and with exactly n entries equal to 1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A002858 (Ulam numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A000567 (Octagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A005898 (Centered cube numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ a b {{cite OEIS|A002378|2=Oblong (or promic, pronic, or heteromecic) numbers: a(n) = n*(n+1)
  • ^ Sloane, N. J. A. (ed.). "Sequence A005900 (Octahedral numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ a b Sloane, N. J. A. (ed.). "Sequence A005385 (Safe primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A059802 (Numbers k such that 5^k - 4^k is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A006036 (Primitive pseudoperfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A000931 (Padovan sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A032020 (Number of compositions (ordered partitions) of n into distinct parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A000538 (Sum of fourth powers: 0^4 + 1^4 + ... + n^4)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A031971 (a(n) = Sum_{k=1..n} k^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A000258 (Expansion of e.g.f. exp(exp(exp(x)-1)-1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A062786 (Centered 10-gonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A005282 (Mian-Chowla sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A001157 (a(n) = sigma_2(n): sum of squares of divisors of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ a b Sloane, N. J. A. (ed.). "Sequence A000292 (Tetrahedral numbers (or triangular pyramidal))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A126796 (Number of complete partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A001608 (Perrin sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A055233 (Composite numbers equal to the sum of the primes from their smallest prime factor to their largest prime factor)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A006562 (Balanced primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A000068 (Numbers k such that k^4 + 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A007678 (Number of regions in regular n-gon with all diagonals drawn)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A003226 (Automorphic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ "Algebra COW Puzzle - Solution". Archived from the original on 2023-10-19. Retrieved 2023-09-21.
  • ^ Sloane, N. J. A. (ed.). "Sequence A001845 (Centered octahedral numbers (crystal ball sequence for cubic lattice))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A306302 (Number of regions into which a figure made up of a row of n adjacent congruent rectangles is divided upon drawing diagonals of all possible rectangles)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A050918 (Woodall primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A072385 (Primes which can be represented as the sum of a prime and its reverse)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A000330 (Square pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A005897 (a(n) = 6*n^2 + 2 for n > 0, a(0)=1)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A000569 (Number of graphical partitions of 2n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A084192 (Array read by antidiagonals: T(n,k) = solution to postage stamp problem with n stamps and k denominations (n >= 1, k >= 1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A317712 (Number of uniform rooted trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ a b Sloane, N. J. A. (ed.). "Sequence A162862 (Numbers n such that n^10 + n^9 + n^8 + n^7 + n^6 + n^5 + n^4 + n^3 + n^2 + n + 1 is prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A006318 (Large Schröder numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  • ^ Sloane, N. J. A. (ed.). "Sequence A002955 (Number of (unordered, unlabeled) rooted trimmed trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

  • Retrieved from "https://en.wikipedia.org/w/index.php?title=300_(number)&oldid=1230237392#316"
     



    Last edited on 21 June 2024, at 14:59  





    Languages

     


    Аԥсшәа
    العربية
    Արեւմտահայերէն
    Azərbaycanca
     / Bân-lâm-gú
    Català
    Čeština
    Emiliàn e rumagnòl
    Эрзянь
    Español
    Esperanto
    Euskara
    فارسی
    Fulfulde
    Gaeilge

    Հայերեն
    Bahasa Indonesia
    Iñupiatun
    Italiano
    עברית
    Kiswahili
    Kreyòl ayisyen
    Luganda
    Magyar
    Македонски

    مازِرونی
    Bahasa Melayu
     
     / Mìng-dĕ̤ng-nḡ
    Nederlands

    Norsk bokmål
    Oʻzbekcha / ўзбекча
    پښتو
    Polski
    Português
    Română
    Sesotho sa Leboa
    Simple English
    Slovenščina
    Soomaaliga
    کوردی
    Svenska
    Tagalog
    Татарча / tatarça

    Українська
    اردو
    Tiếng Vit
    West-Vlams
    ייִדיש


     

    Wikipedia


    This page was last edited on 21 June 2024, at 14:59 (UTC).

    Content is available under CC BY-SA 4.0 unless otherwise noted.



    Privacy policy

    About Wikipedia

    Disclaimers

    Contact Wikipedia

    Code of Conduct

    Developers

    Statistics

    Cookie statement

    Terms of Use

    Desktop