300 (number)

From Justapedia, unleashing the power of collective wisdom
(Redirected from 358 (number))
Jump to navigation Jump to search
← 299 300 301 →
Cardinalthree hundred
Ordinal300th
(three hundredth)
Factorization22 × 3 × 52
Greek numeralΤ´
Roman numeralCCC
Binary1001011002
Ternary1020103
Senary12206
Octal4548
Duodecimal21012
Hexadecimal12C16
Hebrewש (Shin)

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

Mathematical properties

The number 300 is a triangular number and the sum of a pair of twin primes (149 + 151), as well as the sum of ten consecutive primes (13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47). It is palindromic in 3 consecutive bases: 30010 = 6067 = 4548 = 3639, and also in base 13. Factorization is 22 × 3 × 52. 30064 + 1 is prime

Other fields

See also: 300 (disambiguation)

Three hundred is:

Integers from 301 to 399

300s

301

301 = 7 × 43 = . 301 is the sum of three consecutive primes (97 + 101 + 103), happy number in base 10,[1] lazy caterer number (sequence A000124 in the OEIS).

An HTTP status code, indicating the content has been moved and the change is permanent (permanent redirect). It is also the number of a debated Turkish penal code.

302

302 = 2 × 151. 302 is a nontotient,[2] a happy number,[1] the number of partitions of 40 into prime parts[3]

302 is the HTTP status code indicating the content has been moved (temporary redirect). It is also the displacement in cubic inches of Ford's "5.0" V8 and the area code for the state of Delaware.

303

303 = 3 × 101. 303 is a palindromic semiprime. The number of compositions of 10 which cannot be viewed as stacks is 303.[4]

303 is the "See other" HTTP status code, indicating content can be found elsewhere.[5] Model number of the Roland TB-303 synthesizer which is accredited as having been used to create the first acid house music tracks, in the late 1980s.

304

304 = 24 × 19. 304 is the sum of six consecutive primes (41 + 43 + 47 + 53 + 59 + 61), sum of eight consecutive primes (23 + 29 + 31 + 37 + 41 + 43 + 47 + 53), primitive semiperfect number,[6] untouchable number,[7] nontotient.[2] 304 is the smallest number such that no square has a set of digits complementary to the digits of the square of 304: The square of 304 is 92416, while no square exists using the set of the complementary digits 03578.

304 is the HTTP code indicating the content has not been modified, and the record number of wickets taken in English cricket season by Tich Freeman in 1928. 304 is also the name of a card game popular in Sri Lanka and southern India.

It is also one of the telephone area codes for West Virginia.

305

305 = 5 × 61. 305 is the convolution of the first 7 primes with themselves.[8]

305 is the HTTP status code indicating a proxy must be used.

305 cm is the hight of a basketball hoop.

306

306 = 2 × 32 × 17. 306 is the sum of four consecutive primes (71 + 73 + 79 + 83), pronic number,[9] and an untouchable number.[7]

It is also a telephone area code for the province of Saskatchewan, Canada.

307

307 is a prime number, Chen prime,[10] number of one-sided octiamonds[11] and the HTTP status code for "temporary redirect"

308

308 = 22 × 7 × 11. 308 is a nontotient,[2] totient sum of the first 31 integers, heptagonal pyramidal number,[12] and the sum of two consecutive primes (151 + 157).

309

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

310s

310

310 = 2 × 5 × 31. 310 is a sphenic number,[14] noncototient,[15] number of Dyck 11-paths with strictly increasing peaks.[16]

311

Main article: 311 (number)

311 is a prime number. 4311 - 3311 is prime

312

312 = 23 × 3 × 13, idoneal number.

313

Main article: 313 (number)

313 is a prime number.

314

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

315

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

316

316 = 22 × 79. 316 is a centered triangular number[19] and a centered heptagonal number[20]

317

317 is a prime number, Eisenstein prime with no imaginary part, Chen prime,[10] and a strictly non-palindromic number.

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

317 is also shorthand for the LM317 adjustable regulator chip. It is also the area code for the Indianapolis region.

318

Main article: 318 (number)

318 = 2 × 3 × 53. It is a sphenic number,[14] nontotient,[2] and the sum of twelve consecutive primes (7 + 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47)

319

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

"319" is a song by Prince.

British Rail Class 319s are dual-voltage electric multiple unit trains

320s

320

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

321

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

An area code in central Florida.

322

322 = 2 × 7 × 23. 322 is a sphenic,[14] nontotient, untouchable,[7] and a Lucas number.[25]

It is also seen as a Skull and Bones reference of power

323

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.[26] A Lucas and Fibonacci pseudoprime. See 323 (disambiguation)

324

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,[27] and an untouchable number.[7]

325

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

326

326 = 2 × 163. 326 is a nontotient, noncototient,[15] and an untouchable number.[7] 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 (sequence A000124 in the OEIS).

327

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

328

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

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

330s

330

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

331

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

332

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

333

333 = 32 × 37, Mertens function returns 0,[40]

Symbolically, 333 is used to represent Choronzon, a demon used in the philosophy of Thelema.

334

334 = 2 × 167, nontotient.[41]

334 was the long-time highest score for Australia in Test cricket (held by Sir Donald Bradman and Mark Taylor). 334 is also the name of a science fiction novel by Thomas M. Disch.

335

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

336

336 = 24 × 3 × 7, untouchable number,[7] number of partitions of 41 into prime parts.[3] Also the number of dimples on an American golf ball.

337

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

338

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

339

339 = 3 × 113, Ulam number[43]

340s

340

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

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

342

342 = 2 × 32 × 19, pronic number,[9] Untouchable number.[7]

343

343 = 73, the first nice Friedman number that is composite since 343 = (3 + 4)3. It's 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.

The speed of sound in dry air at 20 °C (68 °F) is 343 m/s (1,234.8 km/h)

344

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

345

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

346

346 = 2 × 173, Smith number,[22] noncototient.[15]

347

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

It is the number of an area code in New York.

348

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

349

349, prime number, sum of three consecutive primes (109 + 113 + 127), 5349 - 4349 is a prime number,[48] since 1976 the number of seats in the Swedish parliament.[49]

349 was the winning number of the Pepsi Number Fever grand prize draw on May 25, 1992, which had been printed on 800,000 bottles instead of the intended two. The resulting riots and lawsuits became known as the 349 incident.[50]

350s

350

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

350.org is an international environmental organization. 350 is the number of cubic inches displaced in the most common form of the Small Block Chevrolet V8. The number of seats in the Congress of Deputies (Spain) is 350.

351

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

It is also the 351 Windsor engine from Ford Motor Company as well as the 351 (building) in St. John's, Newfoundland and Labrador.

352

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 (sequence A000124 in the OEIS).

The number of international appearances by Kristine Lilly for the USA women's national football (soccer) team, an all-time record for the sport.

The country calling code for Luxembourg

353

Main article: 353 (number)

353 is a prime number, Chen prime,[10] Proth prime,[53] Eisenstein prime with no imaginary part, palindromic prime, and Mertens function returns 0.[40] 353 is the base of the smallest 4th power that is the sum of 4 other 4th powers, discovered by Norrie in 1911: 3534 = 304 + 1204 + 2724 + 3154. 353 is an index of a prime Lucas number.[54]

354

354 = 2 × 3 × 59 = 14 + 24 + 34 + 44,[55][56] 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

355 = 5 × 71, Smith number,[22] Mertens function returns 0,[40] divisible by the number of primes below it. the numerator of the best simplified rational approximation of pi having a denominator of four digits or fewer. This fraction (355/113) is known as Milü and provides an extremely accurate approximation for pi.

356

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

357

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

357 also refers to firearms or ammunition of .357 caliber, with the best-known cartridge of that size being the .357 Magnum. The .357 SIG, whose name was inspired by the performance of the .357 Magnum, is actually a 9 mm or .355 caliber.

358

358 = 2 × 179, sum of six consecutive primes (47 + 53 + 59 + 61 + 67 + 71), Mertens function returns 0,[40] number of ways to partition {1,2,3,4,5} and then partition each cell (block) into subcells.[57] It is the country calling code for Finland.

359

Main article: 359 (number)

359 is a prime number, safe prime,[47] Eisenstein prime with no imaginary part, Chen prime,[10] and strictly non-palindromic number.

360s

360

Main article: 360 (number)

360 = triangular matchstick number.[58]

361

361 = 192, centered triangular number,[19] centered octagonal number, centered decagonal number,[59] member of the Mian–Chowla sequence;[60] also the number of positions on a standard 19 x 19 Go board. The Bahá'í calendar is based on 19 months of 19 days each.

362

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

363

Main article: 363 (number)

363 = 3 × 112, sum of nine consecutive primes (23 + 29 + 31 + 37 + 41 + 43 + 47 + 53 + 59), Mertens function returns 0,[40] perfect totient number.[31]

364

364 = 22 × 7 × 13, tetrahedral number,[62] sum of twelve consecutive primes (11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53), Mertens function returns 0,[40] 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 total number of gifts received in the song "The Twelve Days of Christmas"

365

Main article: 365 (number)

365 = 5 × 73

366

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

367

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

368

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

369

Main article: 369 (number)

369 = 32 × 41, it is the magic constant of the 9 × 9 normal magic square and n-queens problem for n = 9; there are 369 free polyominoes of order 8. With 370, a Ruth–Aaron pair with only distinct prime factors counted.

370s

370

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.

System/370 is a computing architecture from IBM.

371

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 (sequence A055233 in the OEIS), the next such composite number is 2935561623745, Armstrong number since 33 + 73 + 13 = 371.

372

372 = 22 × 3 × 31, sum of eight consecutive primes (31 + 37 + 41 + 43 + 47 + 53 + 59 + 61), noncototient,[15] untouchable number,[7] refactorable number.[33]

373

373, prime number, balanced prime,[65] two-sided prime, sum of five consecutive primes (67 + 71 + 73 + 79 + 83), permutable prime with 337 and 733, palindromic prime in 3 consecutive bases: 5658 = 4549 = 37310 and also in base 4: 113114.

374

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

375

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

376

376 = 23 × 47, pentagonal number,[35] 1-automorphic number,[68] nontotient, refactorable number.[33]

377

377 = 13 × 29, Fibonacci number, a centered octahedral number,[69] a Lucas and Fibonacci pseudoprime, the sum of the squares of the first six primes, a common approximation for the impedance of free space in ohms.

377 is an approximation of 2π60, which crops up frequently in calculations involving 60 Hz AC power.

378

378 = 2 × 33 × 7, triangular number, cake number, hexagonal number,[28] Smith number.[22]

379

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

380s

380

380 = 22 × 5 × 19, pronic number,[9] 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 OEIS: A306302 and OEIS: A331452.

381

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

It 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

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

383

383, prime number, safe prime,[47] Woodall prime,[70] 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.[71] 4383 - 3383 is prime.

384

Main article: 384 (number)

385

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

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

386

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

386 is also shorthand for the Intel 80386 microprocessor chip. 386 generation refers to South Koreans, especially politicians, born in the '60s (386 세대 [ko]).

387

387 = 32 × 43, number of graphical partitions of 22,[74] also shorthand for the Intel 80387, math coprocessor chip to the 386.

388

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

389

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

Also, 389 equals the displacement in cubic inches of the famous Pontiac GTO V-8 engine of 1964–66. The port number for LDAP, and the name for the Fedora Directory Server project.

390s

390

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

is prime[77]

System/390 is a computing architecture from IBM.

391

391 = 17 × 23, Smith number,[22] centered pentagonal number.[38]

392

392 = 23 × 72, Achilles number.

393

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

393 is the number of county equivalents in Canada

394

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

395

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

396

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

396 also refers to the displacement in cubic inches of early Chevrolet Big-Block engines.

397

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

398

398 = 2 × 199, nontotient.

is prime[77]

399

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

References

  1. ^ a b c Sloane, N. J. A. (ed.). "Sequence A007770 (Happy numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  2. ^ a b c d e Sloane, N. J. A. (ed.). "Sequence A005277 (Nontotients)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  3. ^ a b Sloane, N. J. A. (ed.). "Sequence A000607 (Number of partitions of n into prime parts)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  4. ^ Sloane, N. J. A. (ed.). "Sequence A115981 (The number of compositions of n which cannot be viewed as stacks)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  5. ^ "303 See Other - HTTP | MDN". developer.mozilla.org. Retrieved 9 April 2022.
  6. ^ a b Sloane, N. J. A. (ed.). "Sequence A006036 (Primitive pseudoperfect numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  7. ^ a b c d e f g h Sloane, N. J. A. (ed.). "Sequence A005114 (Untouchable numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  8. ^ Sloane, N. J. A. (ed.). "Sequence A014342 (Convolution of primes with themselves)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  9. ^ a b c Sloane, N. J. A. (ed.). "Sequence A002378 (Oblong numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  10. ^ a b c d e f g h Sloane, N. J. A. (ed.). "Sequence A109611 (Chen primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  11. ^ Sloane, N. J. A. (ed.). "Sequence A006534". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-05-10.
  12. ^ Sloane, N. J. A. (ed.). "Sequence A002413 (Heptagonal pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  13. ^ Sloane, N. J. A. (ed.). "Sequence A007053 (Number of primes <= 2^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2022-06-02.
  14. ^ a b c d e f g h i j k Sloane, N. J. A. (ed.). "Sequence A007304 (Sphenic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  15. ^ a b c d e f g h i j Sloane, N. J. A. (ed.). "Sequence A005278 (Noncototients)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  16. ^ Sloane, N. J. A. (ed.). "Sequence A008930 (Number of compositions (p_1, p_2, p_3, ...) of n with 1 <= p_i <= i for all i)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  17. ^ Sloane, N. J. A. (ed.). "Sequence A006720 (Somos-4 sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  18. ^ "A053624 - OEIS". oeis.org.
  19. ^ a b Sloane, N. J. A. (ed.). "Sequence A005448 (Centered triangular numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  20. ^ a b Sloane, N. J. A. (ed.). "Sequence A069099 (Centered heptagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  21. ^ Guy, Richard; Unsolved Problems in Number Theory, p. 7 ISBN 1475717385
  22. ^ a b c d e f Sloane, N. J. A. (ed.). "Sequence A006753 (Smith numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  23. ^ a b Sloane, N. J. A. (ed.). "Sequence A076980 (Leyland numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  24. ^ Sloane, N. J. A. (ed.). "Sequence A001850 (Central Delannoy numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  25. ^ Sloane, N. J. A. (ed.). "Sequence A000032 (Lucas numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  26. ^ Sloane, N. J. A. (ed.). "Sequence A001006 (Motzkin numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  27. ^ "A000290 - OEIS". oeis.org. Retrieved 2022-10-23.
  28. ^ a b Sloane, N. J. A. (ed.). "Sequence A000384 (Hexagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  29. ^ Sloane, N. J. A. (ed.). "Sequence A001106 (9-gonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  30. ^ Sloane, N. J. A. (ed.). "Sequence A060544 (Centered 9-gonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  31. ^ a b Sloane, N. J. A. (ed.). "Sequence A082897 (Perfect totient numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  32. ^ 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. Retrieved 2022-06-02.
  33. ^ a b c d e f Sloane, N. J. A. (ed.). "Sequence A033950 (Refactorable numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  34. ^ a b Sloane, N. J. A. (ed.). "Sequence A100827 (Highly cototient numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  35. ^ a b Sloane, N. J. A. (ed.). "Sequence A000326 (Pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  36. ^ Sloane, N. J. A. (ed.). "Sequence A036913 (Sparsely totient numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  37. ^ a b Sloane, N. J. A. (ed.). "Sequence A002407 (Cuban primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  38. ^ a b Sloane, N. J. A. (ed.). "Sequence A005891 (Centered pentagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  39. ^ a b Sloane, N. J. A. (ed.). "Sequence A003215 (Hex numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  40. ^ a b c d e f g h i j k l Sloane, N. J. A. (ed.). "Sequence A028442 (Numbers n such that Mertens' function is zero)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  41. ^ Sloane, N. J. A. (ed.). "Sequence A003052 (Self numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-21.
  42. ^ 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.
  43. ^ Sloane, N. J. A. (ed.). "Sequence A002858 (Ulam numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  44. ^ Sloane, N. J. A. (ed.). "Sequence A000567 (Octagonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  45. ^ Sloane, N. J. A. (ed.). "Sequence A005898 (Centered cube numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  46. ^ Sloane, N. J. A. (ed.). "Sequence A005900 (Octahedral numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  47. ^ a b c Sloane, N. J. A. (ed.). "Sequence A005385 (Safe primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  48. ^ 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.
  49. ^ "Riksdagens historia" (in Swedish). Parliament of Sweden. Retrieved 29 March 2016.
  50. ^ "SC decides in finality on 'Pepsi 349' case".
  51. ^ Sloane, N. J. A. (ed.). "Sequence A000931 (Padovan sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  52. ^ 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. Retrieved 2022-05-24.
  53. ^ Sloane, N. J. A. (ed.). "Sequence A080076 (Proth primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  54. ^ Sloane, N. J. A. (ed.). "Sequence A001606 (Indices of prime Lucas numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  55. ^ 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.
  56. ^ Sloane, N. J. A. (ed.). "Sequence A031971 (a(n) = Sum_{k=1..n} k^n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  57. ^ 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.
  58. ^ Sloane, N. J. A. (ed.). "Sequence A045943 (Triangular matchstick numbers: a(n) = 3*n*(n+1)/2)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  59. ^ Sloane, N. J. A. (ed.). "Sequence A062786 (Centered 10-gonal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  60. ^ Sloane, N. J. A. (ed.). "Sequence A005282 (Mian-Chowla sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  61. ^ 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.
  62. ^ Sloane, N. J. A. (ed.). "Sequence A000292 (Tetrahedral numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  63. ^ Sloane, N. J. A. (ed.). "Sequence A126796 (Number of complete partitions of n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  64. ^ Sloane, N. J. A. (ed.). "Sequence A001608 (Perrin sequence)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  65. ^ Sloane, N. J. A. (ed.). "Sequence A006562 (Balanced primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  66. ^ 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.
  67. ^ 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.
  68. ^ Sloane, N. J. A. (ed.). "Sequence A003226 (Automorphic numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  69. ^ 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. Retrieved 2022-06-02.
  70. ^ Sloane, N. J. A. (ed.). "Sequence A050918 (Woodall primes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  71. ^ 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. Retrieved 2019-06-02.
  72. ^ Sloane, N. J. A. (ed.). "Sequence A000330 (Square pyramidal numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  73. ^ 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.
  74. ^ Sloane, N. J. A. (ed.). "Sequence A000569 (Number of graphical partitions of 2n)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  75. ^ 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.
  76. ^ Sloane, N. J. A. (ed.). "Sequence A317712 (Number of uniform rooted trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
  77. ^ 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. Retrieved 2022-06-02.
  78. ^ Sloane, N. J. A. (ed.). "Sequence A006318 (Large Schröder numbers)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Retrieved 2016-05-22.
  79. ^ Sloane, N. J. A. (ed.). "Sequence A002955 (Number of (unordered, unlabeled) rooted trimmed trees with n nodes)". The On-Line Encyclopedia of Integer Sequences. OEIS Foundation.
Retrieved from "https://justapedia.org/index.php?title=300_(number)&oldid=1118656415#358"