Sequences
392,541 sequences
- Aliquot sequence starting at 564.A014361
Aliquot sequence starting at 564.
- Aliquot sequence starting at 660.A014362
Aliquot sequence starting at 660.
- Aliquot sequence starting at 966.A014363
Aliquot sequence starting at 966.
- Aliquot sequence starting at 1074.A014364
Aliquot sequence starting at 1074.
- Aliquot sequence starting at 1134.A014365
Aliquot sequence starting at 1134.
- Inverse of 357th cyclotomic polynomial.A014366
Inverse of 357th cyclotomic polynomial.
- Aronson's sequence in French: m est la premiere, la dixieme ... lettre de cette phrase.A014367
Aronson's sequence in French: m est la premiere, la dixieme ... lettre de cette phrase.
- a(n) = bc, where n = C(b,2)+C(c,1), b>c>=0.A014368
a(n) = bc, where n = C(b,2)+C(c,1), b>c>=0.
- a(n) = bcd, where n = C(b,3)+C(c,2)+C(d,1), b>c>d>=0.A014369
a(n) = bcd, where n = C(b,3)+C(c,2)+C(d,1), b>c>d>=0.
- If n = binomial(b,2) + binomial(c,1), b > c >= 0 then a(n) = binomial(b+1,3) + binomial(c+1,2).A014370
If n = binomial(b,2) + binomial(c,1), b > c >= 0 then a(n) = binomial(b+1,3) + binomial(c+1,2).
- Number of trivalent connected simple graphs with 2*n nodes and girth at least 4.A014371
Number of trivalent connected simple graphs with 2*n nodes and girth at least 4.
- Number of trivalent connected simple graphs with 2n nodes and girth at least 5.A014372
Number of trivalent connected simple graphs with 2n nodes and girth at least 5.
- Inverse of 364th cyclotomic polynomial.A014373
Inverse of 364th cyclotomic polynomial.
- Number of trivalent connected simple graphs with 2n nodes and girth at least 6.A014374
Number of trivalent connected simple graphs with 2n nodes and girth at least 6.
- Number of trivalent connected simple graphs with 2n nodes and girth at least 7.A014375
Number of trivalent connected simple graphs with 2n nodes and girth at least 7.
- Number of trivalent connected simple graphs with 2n nodes and girth at least 8.A014376
Number of trivalent connected simple graphs with 2n nodes and girth at least 8.
- Number of connected regular graphs of degree 7 with 2n nodes.A014377
Number of connected regular graphs of degree 7 with 2n nodes.
- Number of connected regular graphs of degree 8 with n nodes.A014378
Number of connected regular graphs of degree 8 with n nodes.
- Inverse of 370th cyclotomic polynomial.A014379
Inverse of 370th cyclotomic polynomial.
- Inverse of 371st cyclotomic polynomial.A014380
Inverse of 371st cyclotomic polynomial.
- Number of connected regular graphs of degree 9 with 2n nodes.A014381
Number of connected regular graphs of degree 9 with 2n nodes.
- Number of connected regular graphs of degree 10 with n nodes.A014382
Number of connected regular graphs of degree 10 with n nodes.
- Inverse of 374th cyclotomic polynomial.A014383
Inverse of 374th cyclotomic polynomial.
- Number of connected regular graphs of degree 11 with 2n nodes.A014384
Number of connected regular graphs of degree 11 with 2n nodes.
- Number of connected regular bipartite graphs of degree 6 with 2n nodes.A014385
Number of connected regular bipartite graphs of degree 6 with 2n nodes.
- Inverse of 377th cyclotomic polynomial.A014386
Inverse of 377th cyclotomic polynomial.
- Number of connected regular bipartite graphs of degree 7 with 2n nodes.A014387
Number of connected regular bipartite graphs of degree 7 with 2n nodes.
- a(2n-1) = n+2, a(2n) = smallest number requiring n+2 letters in English.A014388
a(2n-1) = n+2, a(2n) = smallest number requiring n+2 letters in English.
- Inverse of 380th cyclotomic polynomial.A014389
Inverse of 380th cyclotomic polynomial.
- Final 2 digits of 7^n.A014390
Final 2 digits of 7^n.
- Final digit of 8^n.A014391
Final digit of 8^n.
- Final 2 digits of 8^n.A014392
Final 2 digits of 8^n.
- Final 2 digits of 9^n.A014393
Final 2 digits of 9^n.
- Inverse of 385th cyclotomic polynomial.A014394
Inverse of 385th cyclotomic polynomial.
- Number of multigraphs with 5 nodes and n edges.A014395
Number of multigraphs with 5 nodes and n edges.
- Number of loopless multigraphs with 6 nodes and n edges.A014396
Number of loopless multigraphs with 6 nodes and n edges.
- Number of loopless multigraphs with 7 nodes and n edges.A014397
Number of loopless multigraphs with 7 nodes and n edges.
- Number of loopless multigraphs with 8 nodes and n edges.A014398
Number of loopless multigraphs with 8 nodes and n edges.
- Inverse of 390th cyclotomic polynomial.A014399
Inverse of 390th cyclotomic polynomial.
- Inverse of 391st cyclotomic polynomial.A014400
Inverse of 391st cyclotomic polynomial.
- Denominators of coefficients of expansion of Bessel function J_3(x).A014401
Denominators of coefficients of expansion of Bessel function J_3(x).
- Numbers found in denominators of expansion of Airy function Ai(x).A014402
Numbers found in denominators of expansion of Airy function Ai(x).
- Numbers found in denominators of expansion of Airy function Bi(x).A014403
Numbers found in denominators of expansion of Airy function Bi(x).
- Number of ways of getting 5 of a kind, straight flush, 4 of a kind, full house, other flush, other straight, 3 of a kind, 2 pair, a pair or no pair in 5-card poker when joker is wild.A014404
Number of ways of getting 5 of a kind, straight flush, 4 of a kind, full house, other flush, other straight, 3 of a kind, 2 pair, a pair or no pair in 5-card poker when joker is wild.
- Number of arithmetic progressions of 3 or more positive integers, strictly increasing with sum n.A014405
Number of arithmetic progressions of 3 or more positive integers, strictly increasing with sum n.
- Number of strictly increasing arithmetic progressions of positive integers with at least 3 terms and sum <= n.A014406
Number of strictly increasing arithmetic progressions of positive integers with at least 3 terms and sum <= n.
- Numbers k such that s(j) < s(k) for all j < k, where s = A014405.A014407
Numbers k such that s(j) < s(k) for all j < k, where s = A014405.
- Inverse of 399th cyclotomic polynomial.A014408
Inverse of 399th cyclotomic polynomial.
- Number of inequivalent ways (mod D_4) a pair of checkers can be placed on an n X n board.A014409
Number of inequivalent ways (mod D_4) a pair of checkers can be placed on an n X n board.
- Elements in Pascal's triangle (by row) that are not 1.A014410
Elements in Pascal's triangle (by row) that are not 1.