close
Jump to content

300 (number)

From Wikipedia, the free encyclopedia
(Redirected from 326 (number))
← 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]
Main article: 301 (number)

302

[edit]
Main article: 302 (number)

303

[edit]
Main article: 303 (number)

304

[edit]
Main article: 304 (number)

305

[edit]
Main article: 305 (number)

306

[edit]
Main article: 306 (number)

307

[edit]
Main article: 307 (number)

308

[edit]
Main article: 308 (number)

309

[edit]
Main article: 309 (number)

310s

[edit]

310

[edit]
Main article: 310 (number)

311

[edit]
Main article: 311 (number)

312

[edit]
Main article: 312 (number)

313

[edit]
Main article: 313 (number)

314

[edit]
Main article: 314 (number)

315

[edit]
Main article: 315 (number)

316

[edit]
Main article: 316 (number)

317

[edit]

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

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

318

[edit]
Main article: 318 (number)

319

[edit]

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

320s

[edit]

320

[edit]

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

321

[edit]

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

322

[edit]

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

323

[edit]
Main article: 323 (number)

324

[edit]

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

325

[edit]
Main article: 325 (number)

326

[edit]

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

327

[edit]

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

328

[edit]

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

329

[edit]

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

330s

[edit]

330

[edit]

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

331

[edit]

331 is a prime number, a super-prime,[27] a cuban prime,[28] a lucky prime,[29] a centered pentagonal number,[30] a centered hexagonal number,[31] and a zero of Mertens function.[32] It is the sum of five consecutive primes (59 + 61 + 67 + 71 + 73).

332

[edit]

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

333

[edit]

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

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

334

[edit]

334 = 2 × 167. It is a nontotient.[34]

335

[edit]

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

336

[edit]

336 = 24 × 3 × 7. It is an untouchable number,[13] and a largely composite number.[36] There are 336 partitions of 41 into prime parts.[37]

337

[edit]

337 is a prime number, an emirp,[38] a permutable prime with 373 and 733,[39] and a Chen prime.[3]

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

339

[edit]

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

340s

[edit]

340

[edit]

340 = 22 × 5 × 17. It is a noncototient[17] 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).

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]
Main article: 341 (number)

342

[edit]

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

343

[edit]

343 = 73, the first nice Friedman number that is composite since 343 = (3 + 4)3.[43] 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,[44] a noncototient,[17] a refactorable number,[21] and the totient sum of the first 33 integers.[15]

345

[edit]

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

346

[edit]

346 = 2 × 173. It is a Smith number[7] and a noncototient.[17]

347

[edit]

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

348

[edit]

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

349

[edit]

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

5349 - 4349 is a prime number.[53]

350s

[edit]

350

[edit]

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

350= [clarification needed]

351

[edit]

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

It is the international calling code for Portugal.[58]

352

[edit]

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

It is the international calling code for Luxembourg.[60]

353

[edit]
Main article: 353 (number)

354

[edit]

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

It is the SMTP code meaning start of mail input[64] and the international calling code for Iceland.[65]

355

[edit]

355 = 5 × 71. It is a Smith number[7] and a zero of Mertens function.[32] The cototient of 355 is 75,[66] 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.[32]

357

[edit]

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

358

[edit]

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

It is the international calling code for Finland.[68]

359

[edit]
Main article: 359 (number)

360s

[edit]

360

[edit]
Main article: 360 (number)

361

[edit]

361 = 192. 361 is a centered triangular number,[69] a centered octagonal number,[70] a centered decagonal number[71] and a member of the Mian–Chowla sequence.[72] There are 361 intersections on a standard 19 x 19 Go board.[73]

362

[edit]

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

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

363

[edit]
Main article: 363 (number)

364

[edit]

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

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]
Main article: 365 (number)

366

[edit]

366 = 2 × 3 × 61. It is a sphenic number,[12] a zero of Mertens function,[32] a noncototient,[17] a 26-gonal number,[76] and a 123-gonal number.[77] There are 366 complete partitions of 20.[78]

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

367

[edit]

367 is a prime number, a lucky prime,[29] a Perrin number,[80] a happy number in base 10, a prime index prime[81] and a strictly non-palindromic number.[82]

368

[edit]

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

369

[edit]
Main article: 369 (number)

370s

[edit]

370

[edit]

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

371

[edit]

371 = 7 × 53. It is an Armstrong number since 33 + 73 + 13 = 371.[85] It is the sum of the primes from its least to its greatest prime factor, the next such composite number is 2935561623745.[86] 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).

372

[edit]

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

373

[edit]

373 is a prime number, a balanced prime,[87] a right and left-truncatable (two-sided prime),[4] a sexy prime with 367 and 379,[88] a permutable prime with 337 and 733[89] Itis 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).

374

[edit]

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

375

[edit]

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

376

[edit]

376 = 23 × 47. It is a pentagonal number,[25] a 1-automorphic number,[92] a nontotient, and a refactorable number.[21]

377

[edit]
Main article: 377 (number)

378

[edit]

378 = 2 × 33 × 7. It is a cake number,[93] a hexagonal number,[94] and a Smith number.[7] It is the 27th triangular number.[95]

379

[edit]

379 is a prime number, a Chen prime,[3] a lazy caterer number[18] 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.[42] 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.[96]

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).[97]

382

[edit]

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

383

[edit]

383 is a prime number, a safe prime,[47] a Woodall prime,[98] a Thabit number[99], an Eisenstein prime with no imaginary part and a palindromic prime.[100] It is also the first number where the sum of a prime and the reversal of the prime is also a prime.[101] 4383 - 3383 is prime.[102]

384

[edit]
Main article: 384 (number)

385

[edit]

385 = 5 × 7 × 11. It is a sphenic number[12] and a square pyramidal number.[103] There are 385 integer partitions of 18.[104]

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

386

[edit]

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

387

[edit]

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

388

[edit]

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

389

[edit]

389 is a prime number, an emirp,[110] an Eisenstein prime with no imaginary part, a Chen prime,[3] a highly cototient number,[23] a strictly non-palindromic number.[111] 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).

is prime[112]

391

[edit]

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

392

[edit]

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

393

[edit]

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

394

[edit]

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

395

[edit]

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

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

396

[edit]

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

397

[edit]

397 is a prime number, a cuban prime,[28] and a centered hexagonal number.[31]

398

[edit]

398 = 2 × 199. It is a nontotient.

is prime[112]

399

[edit]

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

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. ^ a b c d e Sloane, N. J. A. (ed.). "Sequence A109611 (Chen primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  4. ^ 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.
  5. ^ "A003627 - OEIS". oeis.org. Retrieved 2026-06-16.
  6. ^ Guy, Richard; Unsolved Problems in Number Theory, p. 7 ISBN 1475717385
  7. ^ a b c d e f Sloane, N. J. A. (ed.). "Sequence A006753 (Smith numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  8. ^ 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.
  9. ^ a b Sloane, N. J. A. (ed.). "Sequence A076980 (Leyland numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  10. ^ "A003432 - OEIS". oeis.org. Retrieved 2026-06-16.
  11. ^ Sloane, N. J. A. (ed.). "Sequence A001850 (Central Delannoy numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  12. ^ 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.
  13. ^ 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.
  14. ^ Sloane, N. J. A. (ed.). "Sequence A000032 (Lucas numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  15. ^ a b "A002088 - OEIS". oeis.org. Retrieved 2026-06-16.
  16. ^ Sloane, N. J. A. (ed.). "Sequence A000290 (The squares: a(n) = n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  17. ^ 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.
  18. ^ 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.
  19. ^ Sloane, N. J. A. (ed.). "Sequence A082897 (Perfect totient numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  20. ^ 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.
  21. ^ a b c d e f Sloane, N. J. A. (ed.). "Sequence A033950 (Refactorable numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  22. ^ "A007504 - OEIS". oeis.org. Retrieved 2026-06-16.
  23. ^ a b Sloane, N. J. A. (ed.). "Sequence A100827 (Highly cototient numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  24. ^ "A000332 - OEIS". oeis.org. Retrieved 2026-06-16.
  25. ^ a b Sloane, N. J. A. (ed.). "Sequence A000326 (Pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  26. ^ Sloane, N. J. A. (ed.). "Sequence A036913 (Sparsely totient numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  27. ^ "A006450 - OEIS". oeis.org. Retrieved 2026-06-16.
  28. ^ 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.
  29. ^ 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.
  30. ^ a b Sloane, N. J. A. (ed.). "Sequence A005891 (Centered pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  31. ^ a b Sloane, N. J. A. (ed.). "Sequence A003215 (Hex numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  32. ^ 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.
  33. ^ "A010785 - OEIS". oeis.org. Retrieved 2026-06-16.
  34. ^ Sloane, N. J. A. (ed.). "Sequence A003052 (Self numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  35. ^ "A001037 - OEIS". oeis.org. Retrieved 2026-06-16.
  36. ^ Sloane, N. J. A. (ed.). "Sequence A067128 (Ramanujan's largely composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  37. ^ Sloane, N. J. A. (ed.). "Sequence A000607 (Number of partitions of n into prime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  38. ^ "A006567 - OEIS". oeis.org. Retrieved 2026-06-16.
  39. ^ "A003459 - OEIS". oeis.org. Retrieved 2026-06-16.
  40. ^ 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.
  41. ^ Sloane, N. J. A. (ed.). "Sequence A002858 (Ulam numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  42. ^ a b 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.
  43. ^ "A080035 - OEIS". oeis.org. Retrieved 2026-06-16.
  44. ^ Sloane, N. J. A. (ed.). "Sequence A005900 (Octahedral numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  45. ^ "A000926 - OEIS". oeis.org. Retrieved 2026-06-16.
  46. ^ "A006567 - OEIS". oeis.org. Retrieved 2026-06-22.
  47. ^ a b Sloane, N. J. A. (ed.). "Sequence A005385 (Safe primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  48. ^ "A001359 - OEIS". oeis.org. Retrieved 2026-06-22.
  49. ^ "A016038 - OEIS". oeis.org. Retrieved 2026-06-22.
  50. ^ "A112419 - OEIS". oeis.org. Retrieved 2026-06-22.
  51. ^ "A006512 - OEIS". oeis.org. Retrieved 2026-06-22.
  52. ^ "A031157 - OEIS". oeis.org. Retrieved 2026-06-22.
  53. ^ 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.
  54. ^ Sloane, N. J. A. (ed.). "Sequence A006036 (Primitive pseudoperfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  55. ^ Sloane, N. J. A. (ed.). "Sequence A000931 (Padovan sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  56. ^ "A000217 - OEIS". oeis.org. Retrieved 2024-11-28.
  57. ^ 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.
  58. ^ "International Calling Codes - Numerical Listing". www.cs.columbia.edu. Retrieved 2026-06-22.
  59. ^ "A000170 - OEIS". oeis.org. Retrieved 2026-06-22.
  60. ^ "International Calling Codes - Numerical Listing". www.cs.columbia.edu. Archived from the original on 2025-07-22. Retrieved 2026-06-22.
  61. ^ 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.
  62. ^ Sloane, N. J. A. (ed.). "Sequence A031971 (a(n) = Sum_{k=1..n} k^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  63. ^ "A137275 - OEIS". oeis.org. Retrieved 2026-06-22.
  64. ^ Z, Somesh (2022-01-15). "SMTP Response 354". KnownHost. Retrieved 2026-06-22.
  65. ^ "International Calling Codes - Numerical Listing". www.cs.columbia.edu. Retrieved 2026-06-22.
  66. ^ "A051953 - OEIS". oeis.org. Retrieved 2024-11-19.
  67. ^ 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.
  68. ^ "International Calling Codes - Numerical Listing". www.cs.columbia.edu. Archived from the original on 2025-07-22. Retrieved 2026-06-23.
  69. ^ Sloane, N. J. A. (ed.). "Sequence A005448 (Centered triangular numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  70. ^ "A016754 - OEIS". oeis.org. Retrieved 2026-06-23.
  71. ^ Sloane, N. J. A. (ed.). "Sequence A062786 (Centered 10-gonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  72. ^ Sloane, N. J. A. (ed.). "Sequence A005282 (Mian-Chowla sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  73. ^ "Go | History & Rules | Britannica". Encyclopedia Britannica. Retrieved 2026-06-23.
  74. ^ 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.
  75. ^ Sloane, N. J. A. (ed.). "Sequence A000292 (Tetrahedral numbers (or triangular pyramidal))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  76. ^ "A316724 - OEIS". oeis.org. Retrieved 2026-06-23.
  77. ^ "Polygonal Numbers". www.virtuescience.com. Retrieved 2026-06-23.
  78. ^ Sloane, N. J. A. (ed.). "Sequence A126796 (Number of complete partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  79. ^ "What Is a Leap Year? | NASA Space Place – NASA Science for Kids". spaceplace.nasa.gov. Retrieved 2026-06-23.
  80. ^ Sloane, N. J. A. (ed.). "Sequence A001608 (Perrin sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  81. ^ "A006450 - OEIS". oeis.org. Retrieved 2026-06-23.
  82. ^ "A016038 - OEIS". oeis.org. Retrieved 2026-06-22.
  83. ^ "A005188 - OEIS". oeis.org. Retrieved 2026-06-23.
  84. ^ "A006145 - OEIS". oeis.org. Retrieved 2026-06-23.
  85. ^ "A005188 - OEIS". oeis.org. Retrieved 2026-06-23.
  86. ^ 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.
  87. ^ Sloane, N. J. A. (ed.). "Sequence A006562 (Balanced primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  88. ^ "A046119 - OEIS". oeis.org. Retrieved 2026-06-23.
  89. ^ "A003459 - OEIS". oeis.org. Retrieved 2026-06-23.
  90. ^ 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.
  91. ^ 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.
  92. ^ Sloane, N. J. A. (ed.). "Sequence A003226 (Automorphic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  93. ^ "A000217 - OEIS". oeis.org. Retrieved 2024-11-28.
  94. ^ Sloane, N. J. A. (ed.). "Sequence A000384 (Hexagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  95. ^ "A000217 - OEIS". oeis.org. Retrieved 2024-11-28.
  96. ^ 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.
  97. ^ "A007504 - OEIS". oeis.org. Retrieved 2026-06-23.
  98. ^ Sloane, N. J. A. (ed.). "Sequence A050918 (Woodall primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  99. ^ "A055010 - OEIS". oeis.org. Retrieved 2026-06-23.
  100. ^ "A002385 - OEIS". oeis.org. Retrieved 2026-06-23.
  101. ^ 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.
  102. ^ "A059801 - OEIS". oeis.org. Retrieved 2026-06-23.
  103. ^ Sloane, N. J. A. (ed.). "Sequence A000330 (Square pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  104. ^ "A000041 - OEIS". oeis.org. Retrieved 2026-06-23.
  105. ^ Sloane, N. J. A. (ed.). "Sequence A069099 (Centered heptagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  106. ^ 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.
  107. ^ Sloane, N. J. A. (ed.). "Sequence A000569 (Number of graphical partitions of 2n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  108. ^ 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.
  109. ^ Sloane, N. J. A. (ed.). "Sequence A317712 (Number of uniform rooted trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  110. ^ "A006567 - OEIS". oeis.org. Retrieved 2026-06-22.
  111. ^ "A016038 - OEIS". oeis.org. Retrieved 2026-06-22.
  112. ^ 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.
  113. ^ "A052486 - OEIS". oeis.org. Retrieved 2026-06-23.
  114. ^ Sloane, N. J. A. (ed.). "Sequence A006318 (Large Schröder numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  115. ^ 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.
  116. ^ Sloane, N. J. A. (ed.). "Sequence A045575 (Leyland numbers of the second kind)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  117. ^ "A006972 - OEIS". oeis.org. Retrieved 2026-06-23.
Retrieved from "https://en.wikipedia.org/w/index.php?title=300_(number)&oldid=1361648622#326"