Sequences
392,541 sequences
- Number of polygonal graphs.A002560
Number of polygonal graphs.
- a(n) = n^5 + 1.A002561
a(n) = n^5 + 1.
- Number of ways of placing n nonattacking queens on n X n board (symmetric solutions count only once).A002562
Number of ways of placing n nonattacking queens on n X n board (symmetric solutions count only once).
- Number of nonisomorphic solutions to minimal dominating set on queens' graph Q(n).A002563
Number of nonisomorphic solutions to minimal dominating set on queens' graph Q(n).
- Number of different ways one can attack all squares on an n X n chessboard using the minimum number of queens.A002564
Number of different ways one can attack all squares on an n X n chessboard using the minimum number of queens.
- Number of non-isomorphic ways to attack all squares on an n X n chessboard using the smallest possible number of queens with each queen attacking at least one other.A002565
Number of non-isomorphic ways to attack all squares on an n X n chessboard using the smallest possible number of queens with each queen attacking at least one other.
- Number of ways to attack all squares on an n X n chessboard using the smallest possible number of queens with each queen attacking at least one other.A002566
Number of ways to attack all squares on an n X n chessboard using the smallest possible number of queens with each queen attacking at least one other.
- Number of nonisomorphic solutions to minimal independent dominating set on queens' graph Q(n).A002567
Number of nonisomorphic solutions to minimal independent dominating set on queens' graph Q(n).
- Number of different ways one can attack all squares on an n X n chessboard with the smallest number of non-attacking queens needed.A002568
Number of different ways one can attack all squares on an n X n chessboard with the smallest number of non-attacking queens needed.
- Max_{k=0..n} { Number of partitions of n into exactly k parts }.A002569
Max_{k=0..n} { Number of partitions of n into exactly k parts }.
- From a definite integral.A002570
From a definite integral.
- From a definite integral.A002571
From a definite integral.
- Number of partitions of 1 into n powers of 1/2; or (according to one definition of "binary") the number of binary rooted trees.A002572
Number of partitions of 1 into n powers of 1/2; or (according to one definition of "binary") the number of binary rooted trees.
- Restricted partitions.A002573
Restricted partitions.
- Restricted partitions.A002574
Restricted partitions.
- Coefficients of Bell's formula for making change.A002575
Coefficients of Bell's formula for making change.
- Coefficients of Bell's formula for making change.A002576
Coefficients of Bell's formula for making change.
- Number of partitions of 2^n into powers of 2.A002577
Number of partitions of 2^n into powers of 2.
- Number of integral points in a certain sequence of open quadrilaterals.A002578
Number of integral points in a certain sequence of open quadrilaterals.
- Number of integral points in a certain sequence of closed quadrilaterals.A002579
Number of integral points in a certain sequence of closed quadrilaterals.
- Decimal expansion of cube root of 2.A002580
Decimal expansion of cube root of 2.
- Decimal expansion of cube root of 3.A002581
Decimal expansion of cube root of 3.
- Largest prime factor of n! - 1.A002582
Largest prime factor of n! - 1.
- Largest prime factor of n! + 1.A002583
Largest prime factor of n! + 1.
- Largest prime factor of product of first n primes - 1, or 1 if no such prime exists.A002584
Largest prime factor of product of first n primes - 1, or 1 if no such prime exists.
- Largest prime factor of 1 + (product of first n primes).A002585
Largest prime factor of 1 + (product of first n primes).
- Smallest prime factor of 2^n + 1.A002586
Smallest prime factor of 2^n + 1.
- Largest prime factor of 2^n + 1.A002587
Largest prime factor of 2^n + 1.
- a(n) = largest noncomposite factor of 2^(2n+1) - 1.A002588
a(n) = largest noncomposite factor of 2^(2n+1) - 1.
- Largest primitive factor of 2^(2n+1) + 1.A002589
Largest primitive factor of 2^(2n+1) + 1.
- Largest prime factor of 16^n + 1.A002590
Largest prime factor of 16^n + 1.
- Largest prime factor of 3^(2n+1) - 1.A002591
Largest prime factor of 3^(2n+1) - 1.
- Largest prime factor of 9^n + 1.A002592
Largest prime factor of 9^n + 1.
- a(n) = n^2*(2*n^2 - 1); also Sum_{k=0..n-1} (2k+1)^3.A002593
a(n) = n^2*(2*n^2 - 1); also Sum_{k=0..n-1} (2k+1)^3.
- a(n) = n^2*(16*n^4-20*n^2+7)/3.A002594
a(n) = n^2*(16*n^4-20*n^2+7)/3.
- Denominators of Taylor series expansion of arcsin(x). Also arises from arccos(x), arccsc(x), arcsec(x), arcsinh(x).A002595
Denominators of Taylor series expansion of arcsin(x). Also arises from arccos(x), arccsc(x), arcsec(x), arcsinh(x).
- Numerators in expansion of sqrt(1+x). Absolute values give numerators in expansion of sqrt(1-x).A002596
Numerators in expansion of sqrt(1+x). Absolute values give numerators in expansion of sqrt(1-x).
- Number of partitions into one kind of 1's, two kinds of 2's, and three kinds of 3's.A002597
Number of partitions into one kind of 1's, two kinds of 2's, and three kinds of 3's.
- A generalized partition function.A002598
A generalized partition function.
- A generalized partition function.A002599
A generalized partition function.
- A generalized partition function.A002600
A generalized partition function.
- A generalized partition function.A002601
A generalized partition function.
- A generalized partition function.A002602
A generalized partition function.
- A generalized partition function.A002603
A generalized partition function.
- a(n) = n^6 + 1.A002604
a(n) = n^6 + 1.
- a(n) = 2*(a(n-1) + a(n-2)), a(0) = 0, a(1) = 1.A002605
a(n) = 2*(a(n-1) + a(n-2)), a(0) = 0, a(1) = 1.
- Weight distribution of Karlin's [28,14,8] double circulant code.A002606
Weight distribution of Karlin's [28,14,8] double circulant code.
- Glaisher's chi_8(n).A002607
Glaisher's chi_8(n).
- Glaisher's function T(2n+1).A002608
Glaisher's function T(2n+1).
- Glaisher's function G(n) (18 squares version).A002609
Glaisher's function G(n) (18 squares version).