close
Jump to content

300 (number)

From Wikipedia, the free encyclopedia
← 299 300 301 →
Cardinalthree hundred
Ordinal300th
(three hundredth)
Factorization22 × 3 × 52
Greek numeralΤ´
Roman numeralCCC, ccc
Binary1001011002
Ternary1020103
Senary12206
Octal4548
Duodecimal21012
Hexadecimal12C16
Hebrewש
ArmenianՅ
Babylonian cuneiform𒐙
Egyptian hieroglyph𓍤

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

In mathematics

[edit]

300 is a composite number and the 24th triangular number.[1] It is also a second hexagonal number.[2]

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]

310s

[edit]

310

[edit]

311

[edit]

312

[edit]

313

[edit]

314

[edit]

315

[edit]

316

[edit]

317

[edit]

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

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

318

[edit]

318 is a sphenic number,[8] a nontotient[9] and the sum of 12 consecutive primes, 7 + 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47.[10] There are 318 posets with 6 unlabeled elements.[11]

319

[edit]

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

320s

[edit]

320

[edit]

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

321

[edit]

321 = 3 × 107. It is a Delannoy number[16]

322

[edit]

322 = 2 × 7 × 23. It is a sphenic,[17] a nontotient, an untouchable number,[18] and a Lucas number.[19] It is also the first unprimeable number to end in 2.

323

[edit]

324

[edit]

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

325

[edit]

325 is the smallest number to be the sum of two squares in 3 different ways: 12 + 182, 62 + 172 and 102 + 152. It is the smallest (and only known) 3-hyperperfect number.[22][23]

326

[edit]

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

327

[edit]

327 = 3 × 109. It is a perfect totient number.[26] There are 327 compositions of 10 whose run-lengths are either weakly increasing or weakly decreasing.[27]

328

[edit]

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

329

[edit]

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

330s

[edit]

330

[edit]

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

331

[edit]

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

332

[edit]

332 = 22 × 83. It is a zero of Mertens function.[39]

333

[edit]

333 = 32 × 37. It is a zero of Mertens function[39] and a repdigit.[40]

2333 is the smallest power of two greater than a googol.

334

[edit]

334 = 2 × 167. It is a nontotient.

335

[edit]

335 = 5 × 67. There are 335 Lyndon words of length 12.[41]

336

[edit]

336 = 24 × 3 × 7. It is an untouchable number[18] and a largely composite number.[42] There are 336 partitions of 41 into prime parts.[43]

337

[edit]

337 is a prime number[3], an emirp,[44] a permutable prime,[45] and a Chen prime.[4]

338

[edit]

338 = 2 × 132. It is a nontotient. There are 338 square (0,1)-matrices without zero rows and with exactly 4 entries equal to 1.[46]

339

[edit]

339 = 3 × 113. It is an Ulam number.[47]

340s

[edit]

340

[edit]

340 = 22 × 5 × 17. It is a noncototient[24] and a nontotient.

It is the sum of the first four powers of 4 (41 + 42 + 43 + 44), the sum of eight consecutive primes (29 + 31 + 37 + 41 + 43 + 47 + 53 + 59), and the sum of ten consecutive primes (17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53).[3]

There are 340 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). [clarification needed]

341

[edit]

341 is an octagonal number,[48] a centered cube number,[49] and a super-Poulet number.[50] It is a palindrome and repdigit in bases 2 (1010101012), 4 (111114), 8 (5258), 17 (13117) and 30 (BB30). It is the sum of seven consecutive primes (37 + 41 + 43 + 47 + 53 + 59 + 61).[3]

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.[51]

342

[edit]

342 = 2 × 32 × 19. It is a pronic number,[52] and an untouchable number.[18]

343

[edit]

343 = 73, the first nice Friedman number that is composite since 343 = (3 + 4)3.[53] 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. It is an octahedral number,[54] a noncototient,[24] a refactorable number,[28] and the totient sum of the first 33 integers.[20]

345

[edit]

345 = 3 × 5 × 23. It is a sphenic number[17] and an idoneal number.[55]

346

[edit]

346 = 2 × 173. It is a Smith number[12] and a noncototient.[24]

347

[edit]

347 is a prime number[3], an emirp,[56] a safe prime,[57] an Eisenstein prime with no imaginary part, a Chen prime,[4] a twin prime with 349,[58] a strictly non-palindromic number,[59] and a Friedman prime since 347 = 73 + 4.[60]

348

[edit]

348 = 22 × 3 × 29. It is a refactorable number.[28] It is the sum of four consecutive primes (79 + 83 + 89 + 97).[3]

349

[edit]

349 is a prime number[3], a twin prime with 347,[61] and a lucky prime.[62] It is the sum of three consecutive primes (109 + 113 + 127).[3]

5349 - 4349 is a prime number.[63]

350s

[edit]

350

[edit]

350 = 2 × 52 × 7. It is a primitive semiperfect number[64] and a nontotient. A truncated icosahedron of frequency 6 has 350 hexagonal faces and 12 pentagonal faces.

350= , making 350 a stirling number of the second kind.

351

[edit]

351 = 33 × 13. It is a member of the Padovan sequence[65] and the 26th triangular number.[66] It is the sum of five consecutive primes (61 + 67 + 71 + 73 + 79).[3] There are 351 compositions of 15 into distinct parts.[67]

352

[edit]

352 = 25 × 11. It is a lazy caterer number[25] and the sum of two consecutive primes (173 + 179).[3] There are 352 n-Queens Problem solutions for n = 9.[68]

353

[edit]

354

[edit]

354 = 2 × 3 × 59 = 14 + 24 + 34 + 44.[69][70] It is a sphenic number[17] and a nontotient. It is also sum of absolute value of the coefficients of Conway's polynomial.[71]

355

[edit]

355 = 5 × 71. It is a Smith number[12] and a zero of Mertens function.[39] The cototient of 355 is 75,[72] where 75 is the product of its digits (3 x 5 x 5 = 75).

It is the numerator of, 355/113, the best simplified rational approximation of pi having a denominator of four digits or fewer, known as Milü.

356

[edit]

356 = 22 × 89. It is a zero of Mertens function.[39]

357

[edit]

357 = 3 × 7 × 17. It is a sphenic number.[17]

358

[edit]

358 = 2 × 179. It is a zero of Mertens function[39] and the sum of six consecutive primes (47 + 53 + 59 + 61 + 67 + 71).[3] There are 358 ways to partition {1,2,3,4,5} and then partition each cell (block) into subcells.[73][better source needed]

359

[edit]

359 is an Eisenstein prime with no imaginary part[74] and a Chen prime.[75] It is a strictly non-palindromic number.[76]

360s

[edit]

360

[edit]

361

[edit]

361 = 192. 361 is a centered triangular number,[77] a centered octagonal number,[78] a centered decagonal number[79] and a member of the Mian–Chowla sequence.[80] There are 361 intersections on a standard 19 x 19 Go board.[81]

362

[edit]

362 = 2 × 181. It is a zero of Mertens function,[39] a nontotient, a noncototient.[24]

362= σ2(19), the sum of squares of divisors of 19.[82]

363

[edit]

363=3 × 112. It is a deficient number, a perfect totient number,[83] a zero of Mertens function,[84] and a repdigit (BB) in base 32. It is a palindromic number in bases 3, 10, 11 and 32. It is the sum of nine consecutive primes (23 + 29 + 31 + 37 + 41 + 43 + 47 + 53 + 59)[3] and the sum of five consecutive powers of 3 (3 + 9 + 27 + 81 + 243).

363 can be expressed as the sum of three squares in four different ways:

363 = 112 + 112 + 112 = 52 + 72 + 172 = 12 + 12 + 192 = 132 + 132 + 52.

363 cubits is the solution given to Rhind Mathematical Papyrus question 50 – find the side length of an octagon with the same area as a circle 9 khet in diameter.

364

[edit]

364 = 22 × 7 × 13. It is a tetrahedral number,[85] a zero of Mertens function,[39] a nontotient, and the sum of twelve consecutive primes (11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53).[3]

It is a repdigit in base 3 (111111), base 9 (444), base 25 (EE), base 27 (DD), base 51 (77) and base 90 (44).

365

[edit]

366

[edit]

366 = 2 × 3 × 61. It is a sphenic number,[17] a zero of Mertens function,[39] a noncototient,[24] a 26-gonal number,[86] and a 123-gonal number.[87] There are 366 complete partitions of 20.[88]

There are 366 days in a leap year.[89]

367

[edit]

367 is a prime number[3], a lucky prime,[36] a Perrin number,[90] a happy number in base 10, a prime index prime[91] and a strictly non-palindromic number.[92]

368

[edit]

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

369

[edit]

370s

[edit]

370

[edit]

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

371

[edit]

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

372

[edit]

372 = 22 × 3 × 31. It is a noncototient,[24] an untouchable number,[18] and a refactorable number.[28] It is the sum of eight consecutive primes (31 + 37 + 41 + 43 + 47 + 53 + 59 + 61).[3]

373

[edit]

373 is a prime number,[3] a balanced prime,[97] a right and left-truncatable (two-sided prime),[5] a sexy prime with 367 and 379,[98] and a permutable prime with 337 and 733.[99] It is also a palindromic prime in 3 consecutive bases: 5658 = 4549 = 37310 and also in base 4: 113114. It is the sum of five consecutive primes (67 + 71 + 73 + 79 + 83).[3]

374

[edit]

374 = 2 × 11 × 17. It is a sphenic number[17] and a nontotient. 3744 + 1 is prime.[100]

375

[edit]

375 = 3 × 53. There are 375 regions in regular 11-gon with all diagonals drawn.[101]

376

[edit]

376 = 23 × 47. It is a pentagonal number,[32] a 1-automorphic number,[102] a nontotient, and a refactorable number.[28]

377

[edit]

377 is a semiprime and a deficient number.[103] 377 is the 7th centered octahedral number[104] and the 14th nonzero member of the Fibonacci sequence.[105]

378

[edit]

378 = 2 × 33 × 7. It is a cake number,[106] a hexagonal number,[107] and a Smith number.[12] It is the 27th triangular number.[108]

379

[edit]

379 is a prime number,[3] a Chen prime,[4] a lazy caterer number[25] and a happy number in base 10. It is the sum of the first 15 odd 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. It is a pronic number.[52] There are 380 regions when a figure made up of a row of 6 adjacent congruent rectangles is divided by drawing the diagonals of all possible rectangles.[109]

381

[edit]

381 = 3 × 127. It is 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).[110]

382

[edit]

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

383

[edit]

383 is a prime number, a safe prime,[57] a Woodall prime,[111] a Thabit number,[112] an Eisenstein prime with no imaginary part, and a palindromic prime.[113] It is also the first number where the sum of a prime and the reversal of the prime is also a prime.[114] 4383 - 3383 is prime.[115]

384

[edit]

385

[edit]

385 = 5 × 7 × 11. It is a sphenic number[17] and a square pyramidal number.[116] There are 385 integer partitions of 18.[117]

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

386

[edit]

386 = 2 × 193. It is a nontotient, a noncototient,[24] and a centered heptagonal number.[118] There are 388 surface points on a cube with edge-length 9.[119]

387

[edit]

387 = 32 × 43. There are 387 graphical partitions of 22.[120]

388

[edit]

388 = 22 × 97. It is the solution to the postage stamp problem with 6 stamps and 6 denominations.[121] There are 388 uniform rooted trees with 10 nodes.[122]

389

[edit]

389 is a prime number,[3] an emirp,[123] an Eisenstein prime with no imaginary part, a Chen prime,[4] a highly cototient number,[30] a strictly non-palindromic number.[124] It is the smallest conductor of a rank 2 Elliptic curve.

390s

[edit]

390

[edit]

390 = 2 × 3 × 5 × 13. It is a nontotient and the sum of four consecutive primes (89 + 97 + 101 + 103).[3]

is prime[125]

391

[edit]

391 = 17 × 23. It is a Smith number[12] and a centered pentagonal number.[37]

392

[edit]

392 = 23 × 72. It is an Achilles number.[126]

393

[edit]

393 = 3 × 131. It is a Blum integer[127] and a zero of Mertens function.[39]

394

[edit]

394 = 2 × 197 = S5 It is a Schröder number,[128] a nontotient, and a noncototient.[24]

395

[edit]

395 = 5 × 79. There are 395 (unordered, unlabeled) rooted trimmed trees with 11 nodes.[129]

395 is sum of three consecutive primes (127 + 131 + 137) and the sum of five consecutive primes (71 + 73 + 79 + 83 + 89).[3]

396

[edit]

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

397

[edit]

397 is a prime number,[3] a cuban prime,[35] and a centered hexagonal number.[38]

398

[edit]

398 = 2 × 199. It is a nontotient.

is prime[125]

399

[edit]

399 = 3 × 7 × 19=. It is a sphenic number,[17] a Leyland number of the second kind,[131]and the smallest Lucas–Carmichael number.[132]

399! + 1 is prime.

399 is the largest number whose base 10 digit sum is larger than the square root of the number: 3 + 9 + 9 = 21, which is larger than 19.975.

References

[edit]
  1. ↑ "A000217 - OEIS". oeis.org. Retrieved 2024-11-28.
  2. ↑ Sloane, N. J. A. (ed.). "Sequence A014105 (second hexagonal number)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  3. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 Joyce, David E. "Prime numbers to 10000". Clark University. Retrieved 2026-06-30.
  4. 1 2 3 4 5 Sloane, N. J. A. (ed.). "Sequence A109611 (Chen primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  5. 1 2 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.
  6. ↑ "A003627 - OEIS". oeis.org. Retrieved 2026-06-16.
  7. ↑ Guy, Richard; Unsolved Problems in Number Theory, p. 7 ISBN 1475717385
  8. ↑ "Sloane's A007304 : Sphenic numbers". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  9. ↑ "Sloane's A005277 : Nontotients". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-02.
  10. ↑ "A127339". oeis.org. Retrieved 2023-10-27.
  11. ↑ Sloane, N. J. A. (ed.). "Sequence A000112 (Number of partially ordered sets (posets) with n unlabeled elements)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  12. 1 2 3 4 5 6 Sloane, N. J. A. (ed.). "Sequence A006753 (Smith numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  13. ↑ 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.
  14. 1 2 Sloane, N. J. A. (ed.). "Sequence A076980 (Leyland numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  15. ↑ "A003432 - OEIS". oeis.org. Retrieved 2026-06-16.
  16. ↑ Sloane, N. J. A. (ed.). "Sequence A001850 (Central Delannoy numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  17. 1 2 3 4 5 6 7 8 9 Sloane, N. J. A. (ed.). "Sequence A007304 (Sphenic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  18. 1 2 3 4 5 6 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.
  19. ↑ Sloane, N. J. A. (ed.). "Sequence A000032 (Lucas numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  20. 1 2 "A002088 - OEIS". oeis.org. Retrieved 2026-06-16.
  21. ↑ Sloane, N. J. A. (ed.). "Sequence A000290 (The squares: a(n) = n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  22. ↑ 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.
  23. ↑ 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.
  24. 1 2 3 4 5 6 7 8 9 Sloane, N. J. A. (ed.). "Sequence A005278 (Noncototients)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  25. 1 2 3 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.
  26. ↑ Sloane, N. J. A. (ed.). "Sequence A082897 (Perfect totient numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  27. ↑ 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.
  28. 1 2 3 4 5 6 Sloane, N. J. A. (ed.). "Sequence A033950 (Refactorable numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  29. ↑ "A007504 - OEIS". oeis.org. Retrieved 2026-06-16.
  30. 1 2 Sloane, N. J. A. (ed.). "Sequence A100827 (Highly cototient numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  31. ↑ "A000332 - OEIS". oeis.org. Retrieved 2026-06-16.
  32. 1 2 Sloane, N. J. A. (ed.). "Sequence A000326 (Pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  33. ↑ Sloane, N. J. A. (ed.). "Sequence A036913 (Sparsely totient numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  34. ↑ "A006450 - OEIS". oeis.org. Retrieved 2026-06-16.
  35. 1 2 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.
  36. 1 2 Sloane, N. J. A. (ed.). "Sequence A031157 (Numbers that are both lucky and prime)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  37. 1 2 Sloane, N. J. A. (ed.). "Sequence A005891 (Centered pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  38. 1 2 Sloane, N. J. A. (ed.). "Sequence A003215 (Hex numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  39. 1 2 3 4 5 6 7 8 9 10 Sloane, N. J. A. (ed.). "Sequence A028442 (Numbers n such that Mertens' function is zero)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  40. ↑ "A010785 - OEIS". oeis.org. Retrieved 2026-06-16.
  41. ↑ "A001037 - OEIS". oeis.org. Retrieved 2026-06-16.
  42. ↑ Sloane, N. J. A. (ed.). "Sequence A067128 (Ramanujan's largely composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  43. ↑ Sloane, N. J. A. (ed.). "Sequence A000607 (Number of partitions of n into prime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  44. ↑ "A006567 - OEIS". oeis.org. Retrieved 2026-06-16.
  45. ↑ "A003459 - OEIS". oeis.org. Retrieved 2026-06-16.
  46. ↑ 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.
  47. ↑ Sloane, N. J. A. (ed.). "Sequence A002858 (Ulam numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  48. ↑ "A000567 - OEIS". oeis.org. Retrieved 2026-07-02.
  49. ↑ "A005898 - OEIS". oeis.org. Retrieved 2026-07-02.
  50. ↑ Sloane, N. J. A. (ed.). "Sequence A050217 (Super-Poulet numbers: Poulet numbers whose divisors d all satisfy d|2^d-2.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  51. ↑ Sloane, N. J. A. (ed.). "Sequence A001567 (Fermat pseudoprimes to base 2, also called Sarrus numbers or Poulet numbers.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  52. 1 2 Sloane, N. J. A. (ed.). "Sequence A002378 (Oblong (or promic, pronic, or heteromecic) numbers: a(n) = n*(n+1))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  53. ↑ "A080035 - OEIS". oeis.org. Retrieved 2026-06-16.
  54. ↑ Sloane, N. J. A. (ed.). "Sequence A005900 (Octahedral numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  55. ↑ "A000926 - OEIS". oeis.org. Retrieved 2026-06-16.
  56. ↑ "A006567 - OEIS". oeis.org. Retrieved 2026-06-22.
  57. 1 2 Sloane, N. J. A. (ed.). "Sequence A005385 (Safe primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  58. ↑ "A001359 - OEIS". oeis.org. Retrieved 2026-06-22.
  59. ↑ "A016038 - OEIS". oeis.org. Retrieved 2026-06-22.
  60. ↑ "A112419 - OEIS". oeis.org. Retrieved 2026-06-22.
  61. ↑ "A006512 - OEIS". oeis.org. Retrieved 2026-06-22.
  62. ↑ "A031157 - OEIS". oeis.org. Retrieved 2026-06-22.
  63. ↑ 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.
  64. ↑ Sloane, N. J. A. (ed.). "Sequence A006036 (Primitive pseudoperfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  65. ↑ Sloane, N. J. A. (ed.). "Sequence A000931 (Padovan sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  66. ↑ "A000217 - OEIS". oeis.org. Retrieved 2024-11-28.
  67. ↑ 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.
  68. ↑ "A000170 - OEIS". oeis.org. Retrieved 2026-06-22.
  69. ↑ 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.
  70. ↑ Sloane, N. J. A. (ed.). "Sequence A031971 (a(n) = Sum_{k=1..n} k^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  71. ↑ "A137275 - OEIS". oeis.org. Retrieved 2026-06-22.
  72. ↑ "A051953 - OEIS". oeis.org. Retrieved 2024-11-19.
  73. ↑ 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.
  74. ↑ "A003627 - OEIS". oeis.org. Retrieved 2026-06-16.
  75. ↑ "Chen prime". mathworld.wolfram.com.
  76. ↑ Sloane, N. J. A. (ed.). "Sequence A016038". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  77. ↑ Sloane, N. J. A. (ed.). "Sequence A005448 (Centered triangular numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  78. ↑ "A016754 - OEIS". oeis.org. Retrieved 2026-06-23.
  79. ↑ Sloane, N. J. A. (ed.). "Sequence A062786 (Centered 10-gonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  80. ↑ Sloane, N. J. A. (ed.). "Sequence A005282 (Mian-Chowla sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  81. ↑ "Go | History & Rules | Britannica". Encyclopedia Britannica. Retrieved 2026-06-23.
  82. ↑ 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.
  83. ↑ "A082897 - OEIS". oeis.org. Retrieved 2026-07-01.
  84. ↑ "Sloane's A028442 : Numbers n such that Mertens' function is zero". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-06-02.
  85. ↑ Sloane, N. J. A. (ed.). "Sequence A000292 (Tetrahedral numbers (or triangular pyramidal))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  86. ↑ "A316724 - OEIS". oeis.org. Retrieved 2026-06-23.
  87. ↑ "Polygonal Numbers". www.virtuescience.com. Retrieved 2026-06-23.
  88. ↑ Sloane, N. J. A. (ed.). "Sequence A126796 (Number of complete partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  89. ↑ "What Is a Leap Year? | NASA Space Place – NASA Science for Kids". spaceplace.nasa.gov. Retrieved 2026-06-23.
  90. ↑ Sloane, N. J. A. (ed.). "Sequence A001608 (Perrin sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  91. ↑ "A006450 - OEIS". oeis.org. Retrieved 2026-06-23.
  92. ↑ "A016038 - OEIS". oeis.org. Retrieved 2026-06-22.
  93. ↑ "A005188 - OEIS". oeis.org. Retrieved 2026-06-23.
  94. ↑ "A006145 - OEIS". oeis.org. Retrieved 2026-06-23.
  95. ↑ "A005188 - OEIS". oeis.org. Retrieved 2026-06-23.
  96. ↑ 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.
  97. ↑ Sloane, N. J. A. (ed.). "Sequence A006562 (Balanced primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  98. ↑ "A046119 - OEIS". oeis.org. Retrieved 2026-06-23.
  99. ↑ "A003459 - OEIS". oeis.org. Retrieved 2026-06-23.
  100. ↑ 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.
  101. ↑ 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.
  102. ↑ Sloane, N. J. A. (ed.). "Sequence A003226 (Automorphic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  103. ↑ "Number 377 - Facts about the integer". Numbermatics - the number explorer. Retrieved 9 August 2025.
  104. ↑ 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.
  105. ↑ Sloane, N. J. A. (ed.). "Sequence A000045 (Fibonacci numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  106. ↑ "A000217 - OEIS". oeis.org. Retrieved 2024-11-28.
  107. ↑ Sloane, N. J. A. (ed.). "Sequence A000384 (Hexagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  108. ↑ "A000217 - OEIS". oeis.org. Retrieved 2024-11-28.
  109. ↑ 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.
  110. ↑ "A007504 - OEIS". oeis.org. Retrieved 2026-06-23.
  111. ↑ Sloane, N. J. A. (ed.). "Sequence A050918 (Woodall primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  112. ↑ "A055010 - OEIS". oeis.org. Retrieved 2026-06-23.
  113. ↑ "A002385 - OEIS". oeis.org. Retrieved 2026-06-23.
  114. ↑ 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.
  115. ↑ "A059801 - OEIS". oeis.org. Retrieved 2026-06-23.
  116. ↑ Sloane, N. J. A. (ed.). "Sequence A000330 (Square pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  117. ↑ "A000041 - OEIS". oeis.org. Retrieved 2026-06-23.
  118. ↑ Sloane, N. J. A. (ed.). "Sequence A069099 (Centered heptagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  119. ↑ 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.
  120. ↑ Sloane, N. J. A. (ed.). "Sequence A000569 (Number of graphical partitions of 2n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  121. ↑ 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.
  122. ↑ Sloane, N. J. A. (ed.). "Sequence A317712 (Number of uniform rooted trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  123. ↑ "A006567 - OEIS". oeis.org. Retrieved 2026-06-22.
  124. ↑ "A016038 - OEIS". oeis.org. Retrieved 2026-06-22.
  125. 1 2 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.
  126. ↑ "A052486 - OEIS". oeis.org. Retrieved 2026-06-23.
  127. ↑ "A016105 - OEIS". oeis.org. Retrieved 2026-07-02.
  128. ↑ Sloane, N. J. A. (ed.). "Sequence A006318 (Large Schröder numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  129. ↑ 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.
  130. ↑ "A002088 - OEIS". oeis.org. Retrieved 2026-07-02.
  131. ↑ Sloane, N. J. A. (ed.). "Sequence A045575 (Leyland numbers of the second kind)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  132. ↑ "A006972 - OEIS". oeis.org. Retrieved 2026-06-23.
Retrieved from "https://en.wikipedia.org/w/index.php?title=300_(number)&oldid=1364328873"