300 (number)

Natural number

| <- 299  | 300 |  301 ->

|
|

* List of numbers
* Integers

← 0 100 200 300 400 500 600 700 800 900 →

Cardinal| three hundred
Ordinal| 300th
(three hundredth)
Factorization| 22 × 3 × 52
Greek numeral| Τ´
Roman numeral| CCC, ccc
Binary| 1001011002
Ternary| 1020103
Senary| 12206
Octal| 4548
Duodecimal| 21012
Hexadecimal| 12C16
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]

## 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]

315 = 32 × 5 × 7 =  D 7 , 3 {\displaystyle D_{7,3}\\!} , rencontres number, highly composite odd number, having 12 divisors.[2]

It is a Harshad number, as it is divisible by the sum of its digits.[3]

It is a Zuckerman number, as it is divisible by the product of its digits.[4]

#### 316

[edit]

316 = 22 × 79, a centered triangular number[5] and a centered heptagonal number.[6]

#### 317

[edit]

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

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

#### 318

[edit]

Main article: 318 (number)

#### 319

[edit]

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

### 320s

[edit]

#### 320

[edit]

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

#### 321

[edit]

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

#### 322

[edit]

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

#### 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.[17] 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,[18] and an untouchable number.[15]

#### 325

[edit]

Main article: 325 (number)

#### 326

[edit]

326 = 2 × 163\. 326 is a nontotient, noncototient,[19] and an untouchable number.[15] 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[20]

#### 327

[edit]

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

#### 328

[edit]

328 = 23 × 41\. 328 is a refactorable number,[23] 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.[24]

### 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 ( 11 4 ) {\displaystyle {\tbinom {11}{4}}} ), a pentagonal number,[25] divisible by the number of primes below it, and a sparsely totient number.[26]

#### 331

[edit]

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

#### 332

[edit]

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

#### 333

[edit]

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

#### 334

[edit]

334 = 2 × 167, nontotient.[32]

#### 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,[15] number of partitions of 41 into prime parts,[33] largely composite number.[34]

#### 337

[edit]

337, prime number, emirp, permutable prime with 373 and 733, Chen prime,[7] 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.[35]

#### 339

[edit]

339 = 3 × 113, Ulam number[36]

### 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.[19] 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]

Main article: 341 (number)

#### 342

[edit]

342 = 2 × 32 × 19, pronic number,[37] Untouchable number.[15]

#### 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,[38] noncototient,[19] totient sum of the first 33 integers, refactorable number.[23]

#### 345

[edit]

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

#### 346

[edit]

346 = 2 × 173, Smith number,[10] noncototient.[19]

#### 347

[edit]

347 is a prime number, emirp, safe prime,[39] Eisenstein prime with no imaginary part, Chen prime,[7] 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.[23]

#### 349

[edit]

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

### 350s

[edit]

#### 350

[edit]

350 = 2 × 52 × 7 =  { 7 4 } {\displaystyle \left\\{{7 \atop 4}\right\\}} , primitive semiperfect number,[41] 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, 26th triangular number,[42] sum of five consecutive primes (61 + 67 + 71 + 73 + 79), member of Padovan sequence[43] and number of compositions of 15 into distinct parts.[44]

#### 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[20]

#### 353

[edit]

Main article: 353 (number)

#### 354

[edit]

354 = 2 × 3 × 59 = 14 \+ 24 \+ 34 \+ 44,[45][46] sphenic number,[14] nontotient, also SMTP code meaning start of mail input. It is also sum of absolute value of the coefficients of Conway's polynomial.

#### 355

[edit]

355 = 5 × 71, Smith number,[10] Mertens function returns 0,[31] divisible by the number of primes below it.[47] The cototient of 355 is 75,[48] where 75 is the product of its digits (3 x 5 x 5 = 75).

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, being accurate to seven digits.

#### 356

[edit]

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

#### 357

[edit]

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

#### 358

[edit]

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

#### 359

[edit]

Main article: 359 (number)

### 360s

[edit]

#### 360

[edit]

Main article: 360 (number)

#### 361

[edit]

361 = 192. 361 is a centered triangular number,[5] centered octagonal number, centered decagonal number,[50] member of the Mian–Chowla sequence;[51] 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,[52] Mertens function returns 0,[31] nontotient, noncototient.[19]

#### 363

[edit]

Main article: 363 (number)

#### 364

[edit]

364 = 22 × 7 × 13, tetrahedral number,[53] sum of twelve consecutive primes (11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53), Mertens function returns 0,[31] 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.[53]

#### 365

[edit]

Main article: 365 (number)

#### 366

[edit]

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

#### 367

[edit]

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

#### 368

[edit]

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

#### 369

[edit]

Main article: 369 (number)

### 370s

[edit]

#### 370

[edit]

370 = 2 × 5 × 37, sphenic number,[14] 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,[56] 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,[19] untouchable number,[15] \--> refactorable number.[23]

#### 373

[edit]

373, prime number, balanced prime,[57] one of the rare primes to be both right and left-truncatable (two-sided prime),[8] 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,[14] nontotient, 3744 \+ 1 is prime.[58]

#### 375

[edit]

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

#### 376

[edit]

376 = 23 × 47, pentagonal number,[25] 1-automorphic number,[60] nontotient, refactorable number.[23] There is a math puzzle in which when 376 is squared, 376 is also the last three digits, as 376 * 376 = 141376 [61] It is one of the two three-digit numbers where when squared, the last three digits remain the same.

#### 377

[edit]

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

#### 378

[edit]

378 = 2 × 33 × 7, 27th triangular number,[63] cake number,[64] hexagonal number,[65] Smith number.[10]

#### 379

[edit]

379 is a prime number, Chen prime,[7] lazy caterer number[20] 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, pronic number,[37] 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.[66]

#### 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.[10]

#### 383

[edit]

383, prime number, safe prime,[39] Woodall prime,[67] 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.[68] 4383 \- 3383 is prime.

#### 384

[edit]

Main article: 384 (number)

#### 385

[edit]

385 = 5 × 7 × 11, sphenic number,[14] square pyramidal number,[69] 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,[19] centered heptagonal number,[6] number of surface points on a cube with edge-length 9.[70]

#### 387

[edit]

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

#### 388

[edit]

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

#### 389

[edit]

389, prime number, emirp, Eisenstein prime with no imaginary part, Chen prime,[7] highly cototient number,[24] 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,

∑ n = 0 10 390 n {\displaystyle \sum _{n=0}^{10}{390}^{n}} is prime[74]

#### 391

[edit]

391 = 17 × 23, Smith number,[10] centered pentagonal number.[29]

#### 392

[edit]

392 = 23 × 72, Achilles number.

#### 393

[edit]

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

#### 394

[edit]

394 = 2 × 197 = S5 a Schröder number,[75] nontotient, noncototient.[19]

#### 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.[76]

#### 396

[edit]

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

#### 397

[edit]

397, prime number, cuban prime,[27] centered hexagonal number.[30]

#### 398

[edit]

398 = 2 × 199, nontotient.

∑ n = 0 10 398 n {\displaystyle \sum _{n=0}^{10}{398}^{n}} is prime[74]

#### 399

[edit]

399 = 3 × 7 × 19, sphenic number,[14] smallest Lucas–Carmichael number, and a Leyland number of the second kind[77] ( 4 5 − 5 4 {\displaystyle 4^{5}-5^{4}} ). 399! + 1 is prime.

## References

[edit]

1. ^ "A000217 - OEIS". oeis.org. Retrieved 2024-11-28.
2. ^ 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.
3. ^ Sloane, N. J. A. (ed.). "Sequence A005349 (Niven (or Harshad, or harshad) numbers: numbers that are divisible by the sum of their digits.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
4. ^ Sloane, N. J. A. (ed.). "Sequence A007602 (Numbers that are divisible by the product of their digits.)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
5. ^ a b Sloane, N. J. A. (ed.). "Sequence A005448 (Centered triangular numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
6. ^ a b Sloane, N. J. A. (ed.). "Sequence A069099 (Centered heptagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
7. ^ a b c d e Sloane, N. J. A. (ed.). "Sequence A109611 (Chen primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
8. ^ 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.
9. ^ Guy, Richard; Unsolved Problems in Number Theory, p. 7 ISBN 1475717385
10. ^ a b c d e f Sloane, N. J. A. (ed.). "Sequence A006753 (Smith numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
11. ^ 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.
12. ^ a b Sloane, N. J. A. (ed.). "Sequence A076980 (Leyland numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
13. ^ Sloane, N. J. A. (ed.). "Sequence A001850 (Central Delannoy numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
14. ^ 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.
15. ^ 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.
16. ^ Sloane, N. J. A. (ed.). "Sequence A000032 (Lucas numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
17. ^ Sloane, N. J. A. (ed.). "Sequence A001006 (Motzkin numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
18. ^ Sloane, N. J. A. (ed.). "Sequence A000290 (The squares: a(n) = n^2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
19. ^ 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.
20. ^ 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.
21. ^ Sloane, N. J. A. (ed.). "Sequence A082897 (Perfect totient numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
22. ^ 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.
23. ^ a b c d e f Sloane, N. J. A. (ed.). "Sequence A033950 (Refactorable numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
24. ^ a b Sloane, N. J. A. (ed.). "Sequence A100827 (Highly cototient numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
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. ^ 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.
28. ^ 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.
29. ^ a b Sloane, N. J. A. (ed.). "Sequence A005891 (Centered pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
30. ^ a b Sloane, N. J. A. (ed.). "Sequence A003215 (Hex numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
31. ^ 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.
32. ^ Sloane, N. J. A. (ed.). "Sequence A003052 (Self numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
33. ^ Sloane, N. J. A. (ed.). "Sequence A000607 (Number of partitions of n into prime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
34. ^ Sloane, N. J. A. (ed.). "Sequence A067128 (Ramanujan's largely composite numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
35. ^ 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.
36. ^ Sloane, N. J. A. (ed.). "Sequence A002858 (Ulam numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
37. ^ 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.
38. ^ Sloane, N. J. A. (ed.). "Sequence A005900 (Octahedral numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
39. ^ a b Sloane, N. J. A. (ed.). "Sequence A005385 (Safe primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
40. ^ 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.
41. ^ Sloane, N. J. A. (ed.). "Sequence A006036 (Primitive pseudoperfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
42. ^ "A000217 - OEIS". oeis.org. Retrieved 2024-11-28.
43. ^ Sloane, N. J. A. (ed.). "Sequence A000931 (Padovan sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
44. ^ 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.
45. ^ 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.
46. ^ Sloane, N. J. A. (ed.). "Sequence A031971 (a(n) = Sum_{k=1..n} k^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
47. ^ "A057809 - OEIS". oeis.org. Retrieved 2024-11-19.
48. ^ "A051953 - OEIS". oeis.org. Retrieved 2024-11-19.
49. ^ 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.
50. ^ Sloane, N. J. A. (ed.). "Sequence A062786 (Centered 10-gonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
51. ^ Sloane, N. J. A. (ed.). "Sequence A005282 (Mian-Chowla sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
52. ^ 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.
53. ^ a b Sloane, N. J. A. (ed.). "Sequence A000292 (Tetrahedral numbers (or triangular pyramidal))". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
54. ^ Sloane, N. J. A. (ed.). "Sequence A126796 (Number of complete partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
55. ^ Sloane, N. J. A. (ed.). "Sequence A001608 (Perrin sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
56. ^ 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.
57. ^ Sloane, N. J. A. (ed.). "Sequence A006562 (Balanced primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
58. ^ 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.
59. ^ 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.
60. ^ Sloane, N. J. A. (ed.). "Sequence A003226 (Automorphic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
61. ^ "Algebra COW Puzzle - Solution". Archived from the original on 2023-10-19. Retrieved 2023-09-21.
62. ^ 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.
63. ^ "A000217 - OEIS". oeis.org. Retrieved 2024-11-28.
64. ^ "A000217 - OEIS". oeis.org. Retrieved 2024-11-28.
65. ^ Sloane, N. J. A. (ed.). "Sequence A000384 (Hexagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
66. ^ 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.
67. ^ Sloane, N. J. A. (ed.). "Sequence A050918 (Woodall primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
68. ^ 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.
69. ^ Sloane, N. J. A. (ed.). "Sequence A000330 (Square pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
70. ^ 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.
71. ^ Sloane, N. J. A. (ed.). "Sequence A000569 (Number of graphical partitions of 2n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
72. ^ 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.
73. ^ Sloane, N. J. A. (ed.). "Sequence A317712 (Number of uniform rooted trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
74. ^ 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.
75. ^ Sloane, N. J. A. (ed.). "Sequence A006318 (Large Schröder numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
76. ^ 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.
77. ^ Sloane, N. J. A. (ed.). "Sequence A045575 (Leyland numbers of the second kind)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.

* v
* t
* e

Integers

* 0
* 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
* 33
* 34
* 35
* 36
* 37
* 38
* 39

* 40
* 41
* 42
* 43
* 44
* 45
* 46
* 47
* 48
* 49

* 50
* 51
* 52
* 53
* 54
* 55
* 56
* 57
* 58
* 59

* 60
* 61
* 62
* 63
* 64
* 65
* 66
* 67
* 68
* 69

* 70
* 71
* 72
* 73
* 74
* 75
* 76
* 77
* 78
* 79

* 80
* 81
* 82
* 83
* 84
* 85
* 86
* 87
* 88
* 89

* 90
* 91
* 92
* 93
* 94
* 95
* 96
* 97
* 98
* 99

100s

* 100
* 101
* 102
* 103
* 104
* 105
* 106
* 107
* 108
* 109

* 110
* 111
* 112
* 113
* 114
* 115
* 116
* 117
* 118
* 119

* 120
* 121
* 122
* 123
* 124
* 125
* 126
* 127
* 128
* 129

* 130
* 131
* 132
* 133
* 134
* 135
* 136
* 137
* 138
* 139

* 140
* 141
* 142
* 143
* 144
* 145
* 146
* 147
* 148
* 149

* 150
* 151
* 152
* 153
* 154
* 155
* 156
* 157
* 158
* 159

* 160
* 161
* 162
* 163
* 164
* 165
* 166
* 167
* 168
* 169

* 170
* 171
* 172
* 173
* 174
* 175
* 176
* 177
* 178
* 179

* 180
* 181
* 182
* 183
* 184
* 185
* 186
* 187
* 188
* 189

* 190
* 191
* 192
* 193
* 194
* 195
* 196
* 197
* 198
* 199

200s

* 200
* 201
* 202
* 203
* 204
* 205
* 206
* 207
* 208
* 209

* 210
* 211
* 212
* 213
* 214
* 215
* 216
* 217
* 218
* 219

* 220
* 221
* 222
* 223
* 224
* 225
* 226
* 227
* 228
* 229

* 230
* 231
* 232
* 233
* 234
* 235
* 236
* 237
* 238
* 239

* 240
* 241
* 242
* 243
* 244
* 245
* 246
* 247
* 248
* 249

* 250
* 251
* 252
* 253
* 254
* 255
* 256
* 257
* 258
* 259

* 260
* 261
* 262
* 263
* 264
* 265
* 266
* 267
* 268
* 269

* 270
* 271
* 272
* 273
* 274
* 275
* 276
* 277
* 278
* 279

* 280
* 281
* 282
* 283
* 284
* 285
* 286
* 287
* 288
* 289

* 290
* 291
* 292
* 293
* 294
* 295
* 296
* 297
* 298
* 299

300s

* 300
* 301
* 302
* 303
* 304
* 305
* 306
* 307
* 308
* 309

* 310
* 311
* 312
* 313
* 314
* 315
* 316
* 317
* 318
* 319

* 320
* 321
* 322
* 323
* 324
* 325
* 326
* 327
* 328
* 329

* 330
* 331
* 332
* 333
* 334
* 335
* 336
* 337
* 338
* 339

* 340
* 341
* 342
* 343
* 344
* 345
* 346
* 347
* 348
* 349

* 350
* 351
* 352
* 353
* 354
* 355
* 356
* 357
* 358
* 359

* 360
* 361
* 362
* 363
* 364
* 365
* 366
* 367
* 368
* 369

* 370
* 371
* 372
* 373
* 374
* 375
* 376
* 377
* 378
* 379

* 380
* 381
* 382
* 383
* 384
* 385
* 386
* 387
* 388
* 389

* 390
* 391
* 392
* 393
* 394
* 395
* 396
* 397
* 398
* 399

400s

* 400
* 401
* 402
* 403
* 404
* 405
* 406
* 407
* 408
* 409

* 410
* 411
* 412
* 413
* 414
* 415
* 416
* 417
* 418
* 419

* 420
* 421
* 422
* 423
* 424
* 425
* 426
* 427
* 428
* 429

* 430
* 431
* 432
* 433
* 434
* 435
* 436
* 437
* 438
* 439

* 440
* 441
* 442
* 443
* 444
* 445
* 446
* 447
* 448
* 449

* 450
* 451
* 452
* 453
* 454
* 455
* 456
* 457
* 458
* 459

* 460
* 461
* 462
* 463
* 464
* 465
* 466
* 467
* 468
* 469

* 470
* 471
* 472
* 473
* 474
* 475
* 476
* 477
* 478
* 479

* 480
* 481
* 482
* 483
* 484
* 485
* 486
* 487
* 488
* 489

* 490
* 491
* 492
* 493
* 494
* 495
* 496
* 497
* 498
* 499

500s

* 500
* 501
* 502
* 503
* 504
* 505
* 506
* 507
* 508
* 509

* 510
* 511
* 512
* 513
* 514
* 515
* 516
* 517
* 518
* 519

* 520
* 521
* 522
* 523
* 524
* 525
* 526
* 527
* 528
* 529

* 530
* 531
* 532
* 533
* 534
* 535
* 536
* 537
* 538
* 539

* 540
* 541
* 542
* 543
* 544
* 545
* 546
* 547
* 548
* 549

* 550
* 551
* 552
* 553
* 554
* 555
* 556
* 557
* 558
* 559

* 560
* 561
* 562
* 563
* 564
* 565
* 566
* 567
* 568
* 569

* 570
* 571
* 572
* 573
* 574
* 575
* 576
* 577
* 578
* 579

* 580
* 581
* 582
* 583
* 584
* 585
* 586
* 587
* 588
* 589

* 590
* 591
* 592
* 593
* 594
* 595
* 596
* 597
* 598
* 599

600s

* 600
* 601
* 602
* 603
* 604
* 605
* 606
* 607
* 608
* 609

* 610
* 611
* 612
* 613
* 614
* 615
* 616
* 617
* 618
* 619

* 620
* 621
* 622
* 623
* 624
* 625
* 626
* 627
* 628
* 629

* 630
* 631
* 632
* 633
* 634
* 635
* 636
* 637
* 638
* 639

* 640
* 641
* 642
* 643
* 644
* 645
* 646
* 647
* 648
* 649

* 650
* 651
* 652
* 653
* 654
* 655
* 656
* 657
* 658
* 659

* 660
* 661
* 662
* 663
* 664
* 665
* 666
* 667
* 668
* 669

* 670
* 671
* 672
* 673
* 674
* 675
* 676
* 677
* 678
* 679

* 680
* 681
* 682
* 683
* 684
* 685
* 686
* 687
* 688
* 689

* 690
* 691
* 692
* 693
* 694
* 695
* 696
* 697
* 698
* 699

700s

* 700
* 701
* 702
* 703
* 704
* 705
* 706
* 707
* 708
* 709

* 710
* 711
* 712
* 713
* 714
* 715
* 716
* 717
* 718
* 719

* 720
* 721
* 722
* 723
* 724
* 725
* 726
* 727
* 728
* 729

* 730
* 731
* 732
* 733
* 734
* 735
* 736
* 737
* 738
* 739

* 740
* 741
* 742
* 743
* 744
* 745
* 746
* 747
* 748
* 749

* 750
* 751
* 752
* 753
* 754
* 755
* 756
* 757
* 758
* 759

* 760
* 761
* 762
* 763
* 764
* 765
* 766
* 767
* 768
* 769

* 770
* 771
* 772
* 773
* 774
* 775
* 776
* 777
* 778
* 779

* 780
* 781
* 782
* 783
* 784
* 785
* 786
* 787
* 788
* 789

* 790
* 791
* 792
* 793
* 794
* 795
* 796
* 797
* 798
* 799

800s

* 800
* 801
* 802
* 803
* 804
* 805
* 806
* 807
* 808
* 809

* 810
* 811
* 812
* 813
* 814
* 815
* 816
* 817
* 818
* 819

* 820
* 821
* 822
* 823
* 824
* 825
* 826
* 827
* 828
* 829

* 830
* 831
* 832
* 833
* 834
* 835
* 836
* 837
* 838
* 839

* 840
* 841
* 842
* 843
* 844
* 845
* 846
* 847
* 848
* 849

* 850
* 851
* 852
* 853
* 854
* 855
* 856
* 857
* 858
* 859

* 860
* 861
* 862
* 863
* 864
* 865
* 866
* 867
* 868
* 869

* 870
* 871
* 872
* 873
* 874
* 875
* 876
* 877
* 878
* 879

* 880
* 881
* 882
* 883
* 884
* 885
* 886
* 887
* 888
* 889

* 890
* 891
* 892
* 893
* 894
* 895
* 896
* 897
* 898
* 899

900s

* 900
* 901
* 902
* 903
* 904
* 905
* 906
* 907
* 908
* 909

* 910
* 911
* 912
* 913
* 914
* 915
* 916
* 917
* 918
* 919

* 920
* 921
* 922
* 923
* 924
* 925
* 926
* 927
* 928
* 929

* 930
* 931
* 932
* 933
* 934
* 935
* 936
* 937
* 938
* 939

* 940
* 941
* 942
* 943
* 944
* 945
* 946
* 947
* 948
* 949

* 950
* 951
* 952
* 953
* 954
* 955
* 956
* 957
* 958
* 959

* 960
* 961
* 962
* 963
* 964
* 965
* 966
* 967
* 968
* 969

* 970
* 971
* 972
* 973
* 974
* 975
* 976
* 977
* 978
* 979

* 980
* 981
* 982
* 983
* 984
* 985
* 986
* 987
* 988
* 989

* 990
* 991
* 992
* 993
* 994
* 995
* 996
* 997
* 998
* 999

1000s

* 1000
* 2000
* 3000
* 4000
* 5000
* 6000
* 7000
* 8000
* 9000

* 10,000
* 20,000
* 30,000
* 40,000
* 50,000
* 60,000
* 70,000
* 80,000
* 90,000

* 100,000
* 1,000,000
* 10,000,000
* 100,000,000
* 1,000,000,000
* 10,000,000,000

*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template