Sequences
392,541 sequences
- a(n) = T(4,n), array T given by A047858.A047861
a(n) = T(4,n), array T given by A047858.
- a(n) = T(5,n), array T given by A047858.A047862
a(n) = T(5,n), array T given by A047858.
- Number of labeled graphs with 2-colored nodes where black nodes are only connected to white nodes and vice versa.A047863
Number of labeled graphs with 2-colored nodes where black nodes are only connected to white nodes and vice versa.
- Number of labeled bipartite graphs with n nodes.A047864
Number of labeled bipartite graphs with n nodes.
- Number of derangements of n where minimal cycle size is at least 4.A047865
Number of derangements of n where minimal cycle size is at least 4.
- a(n) = ceiling(n*(n+1)*(n+2)/8).A047866
a(n) = ceiling(n*(n+1)*(n+2)/8).
- Erroneous version of A002538.A047867
Erroneous version of A002538.
- Erroneous version of A002539.A047868
Erroneous version of A002539.
- Subsets of an 8-element set in order by number of elements in each subset.A047869
Subsets of an 8-element set in order by number of elements in each subset.
- Smallest number that is not a sum of at most one power of each of the numbers 1 through n.A047870
Smallest number that is not a sum of at most one power of each of the numbers 1 through n.
- a(n) = smallest number > a(n-1) that is not a sum of exactly one power of each of the numbers 1 through n.A047871
a(n) = smallest number > a(n-1) that is not a sum of exactly one power of each of the numbers 1 through n.
- a(n) = floor(abs(B(2*n + 2)/B(2*n))) where B(n) is the n-th Bernoulli number.A047872
a(n) = floor(abs(B(2*n + 2)/B(2*n))) where B(n) is the n-th Bernoulli number.
- a(n) = max_{r=1..n-1} ceiling(t(t(n)-t(r-1))/(n-r+1)), where t() = triangular numbers A000217.A047873
a(n) = max_{r=1..n-1} ceiling(t(t(n)-t(r-1))/(n-r+1)), where t() = triangular numbers A000217.
- Triangle of numbers T(n,k) = number of permutations of (1,2,...,n) with longest increasing subsequence of length k (1<=k<=n).A047874
Triangle of numbers T(n,k) = number of permutations of (1,2,...,n) with longest increasing subsequence of length k (1<=k<=n).
- Size of smallest polyomino with surround number n (the surround number of a polyomino is the number of different ways that it can be surrounded by non-overlapping copies of the same polyomino).A047875
Size of smallest polyomino with surround number n (the surround number of a polyomino is the number of different ways that it can be surrounded by non-overlapping copies of the same polyomino).
- a(n) = Sum{T(i,n-i): i=0,1,...,n}, array T as in A049604.A047876
a(n) = Sum{T(i,n-i): i=0,1,...,n}, array T as in A049604.
- a(n) = (1/2)*Sum_{i=0..n} T(i,n-i), array T as in A049604.A047877
a(n) = (1/2)*Sum_{i=0..n} T(i,n-i), array T as in A049604.
- a(n) is the least number of knight's moves from corner (0,0) to n-th diagonal of unbounded chessboard.A047878
a(n) is the least number of knight's moves from corner (0,0) to n-th diagonal of unbounded chessboard.
- a(n)=Sum{T(n,i): i=0,1,...,n}+Sum{T(i,n): i=0,1,...,n-1}, array T counting least number of knight's moves as in A049604.A047879
a(n)=Sum{T(n,i): i=0,1,...,n}+Sum{T(i,n): i=0,1,...,n-1}, array T counting least number of knight's moves as in A049604.
- a(n) = A047879(n) / 2.A047880
a(n) = A047879(n) / 2.
- a(n) = Sum_{h=0..n, k=0..n} T(h,k), array T counting knights' moves as in A049604.A047881
a(n) = Sum_{h=0..n, k=0..n} T(h,k), array T counting knights' moves as in A049604.
- a(n) = A047881(n) / 2.A047882
a(n) = A047881(n) / 2.
- Squares on unbounded chessboard for which the least number of knight's moves from corner (0,0) is n.A047883
Squares on unbounded chessboard for which the least number of knight's moves from corner (0,0) is n.
- Triangle of numbers a(n,k) = number of Young tableaux with n cells and k rows (1 <= k <= n); also number of self-inverse permutations on n letters in which the length of the longest scattered (i.e., not necessarily contiguous) increasing subsequence is k.A047884
Triangle of numbers a(n,k) = number of Young tableaux with n cells and k rows (1 <= k <= n); also number of self-inverse permutations on n letters in which the length of the longest scattered (i.e., not necessarily contiguous) increasing subsequence is k.
- Array a(m,n) = pi(m+n) - pi(m) - pi(n) read by antidiagonals, where pi() = A000720 (m,n >= 0).A047885
Array a(m,n) = pi(m+n) - pi(m) - pi(n) read by antidiagonals, where pi() = A000720 (m,n >= 0).
- Triangle read by rows: T(n,k) = pi(n+k) - pi(n) - pi(k), where pi() = A000720 (n >= 0, 0 <= k <= n).A047886
Triangle read by rows: T(n,k) = pi(n+k) - pi(n) - pi(k), where pi() = A000720 (n >= 0, 0 <= k <= n).
- Triangle of numbers T(n,k) = number of permutations of n things with longest increasing subsequence of length <=k (1<=k<=n).A047887
Triangle of numbers T(n,k) = number of permutations of n things with longest increasing subsequence of length <=k (1<=k<=n).
- Rectangular array of numbers a(n,k) = number of permutations of n things with longest increasing subsequence of length <= k (1 <= k <= oo), read by antidiagonals.A047888
Rectangular array of numbers a(n,k) = number of permutations of n things with longest increasing subsequence of length <= k (1 <= k <= oo), read by antidiagonals.
- Number of permutations in S_n with longest increasing subsequence of length <= 4.A047889
Number of permutations in S_n with longest increasing subsequence of length <= 4.
- Number of permutations in S_n with longest increasing subsequence of length <= 5.A047890
Number of permutations in S_n with longest increasing subsequence of length <= 5.
- Number of planar rooted trees with n nodes and tricolored end nodes.A047891
Number of planar rooted trees with n nodes and tricolored end nodes.
- a(1) = 2; for n > 0, a(n+1) = a(n) * sum of digits of a(n).A047892
a(1) = 2; for n > 0, a(n+1) = a(n) * sum of digits of a(n).
- Number of decimal digits of Euler (Zig) numbers A000364.A047893
Number of decimal digits of Euler (Zig) numbers A000364.
- Number of digits of A000182(n).A047894
Number of digits of A000182(n).
- Difference of decimal orders of Euler and Tangential numbers: deviations of Zigs and Zags.A047895
Difference of decimal orders of Euler and Tangential numbers: deviations of Zigs and Zags.
- For given n, consider all 4-tuples P = (a,b,c,d) with P.P = n; let d = squared distance to the line OP from the closest point of Z^n (excluding the endpoints); sequence gives max_P d*n.A047896
For given n, consider all 4-tuples P = (a,b,c,d) with P.P = n; let d = squared distance to the line OP from the closest point of Z^n (excluding the endpoints); sequence gives max_P d*n.
- a(1) = 5; for n > 0, a(n+1) = a(n) * sum of digits of a(n).A047897
a(1) = 5; for n > 0, a(n+1) = a(n) * sum of digits of a(n).
- a(1) = 6; for n > 0, a(n+1) = a(n) * (sum of digits of a(n)).A047898
a(1) = 6; for n > 0, a(n+1) = a(n) * (sum of digits of a(n)).
- a(1) = 7; for n > 0, a(n+1) = a(n) * sum of digits of a(n).A047899
a(1) = 7; for n > 0, a(n+1) = a(n) * sum of digits of a(n).
- a(1) = 8; for n > 1, a(n+1) = a(n) * sum of digits of a(n).A047900
a(1) = 8; for n > 1, a(n+1) = a(n) * sum of digits of a(n).
- a(1) = 9; a(n+1) = a(n) * sum of decimal digits of a(n).A047901
a(1) = 9; a(n+1) = a(n) * sum of decimal digits of a(n).
- a(1) = 11; for n > 0, a(n+1) = a(n) * sum of digits of a(n).A047902
a(1) = 11; for n > 0, a(n+1) = a(n) * sum of digits of a(n).
- a(1) = 13; for n > 0, a(n+1) = a(n) * sum of digits of a(n).A047903
a(1) = 13; for n > 0, a(n+1) = a(n) * sum of digits of a(n).
- a(n+1) = a(n) + n (if n is odd), a(n+1) = a(n) * n (if n is even).A047904
a(n+1) = a(n) + n (if n is odd), a(n+1) = a(n) * n (if n is even).
- a(n+1) = a(n) + n (if n is even), a(n+1) = a(n) * n (if n is odd).A047905
a(n+1) = a(n) + n (if n is even), a(n+1) = a(n) * n (if n is odd).
- a(n+1) = a(n) - n (if n is odd), a(n+1) = a(n) * n (if n is even).A047906
a(n+1) = a(n) - n (if n is odd), a(n+1) = a(n) * n (if n is even).
- a(n+1) = a(n) - n (if n is even), a(n+1) = a(n) * n (if n is odd).A047907
a(n+1) = a(n) - n (if n is even), a(n+1) = a(n) * n (if n is odd).
- a(n+1) = a(n) op n, where op is successively +, *, -.A047908
a(n+1) = a(n) op n, where op is successively +, *, -.
- Array read by antidiagonals upwards: h(n,k) = number of sequences with n copies each of 1,2,...,k and longest increasing subsequence of length k (n>=1, k>=1).A047909
Array read by antidiagonals upwards: h(n,k) = number of sequences with n copies each of 1,2,...,k and longest increasing subsequence of length k (n>=1, k>=1).
- Number of words on {1,1,1,2,2,2,...,n,n,n} with longest increasing subsequence of length n.A047910
Number of words on {1,1,1,2,2,2,...,n,n,n} with longest increasing subsequence of length n.