Sequences

392,541 sequences

Number of partitions of n such that cn(1,5) < cn(0,5) = cn(2,5) < cn(3,5) = cn(4,5).A036861
Number of partitions of n such that cn(1,5) < cn(0,5) = cn(2,5) < cn(3,5) = cn(4,5).
Number of partitions of n such that cn(0,5) = cn(1,5) <= cn(2,5) = cn(4,5) <= cn(3,5).A036862
Number of partitions of n such that cn(0,5) = cn(1,5) <= cn(2,5) = cn(4,5) <= cn(3,5).
Number of partitions of n such that cn(0,5) = cn(1,5) <= cn(2,5) = cn(4,5) < cn(3,5).A036863
Number of partitions of n such that cn(0,5) = cn(1,5) <= cn(2,5) = cn(4,5) < cn(3,5).
Number of partitions of n such that cn(0,5) = cn(1,5) <= cn(3,5) <= cn(2,5) = cn(4,5).A036864
Number of partitions of n such that cn(0,5) = cn(1,5) <= cn(3,5) <= cn(2,5) = cn(4,5).
Number of partitions of n such that cn(3,5) <= cn(0,5) = cn(1,5) <= cn(2,5) = cn(4,5).A036865
Number of partitions of n such that cn(3,5) <= cn(0,5) = cn(1,5) <= cn(2,5) = cn(4,5).
Number of partitions of n such that cn(0,5) = cn(1,5) = cn(3,5) <= cn(2,5) = cn(4,5).A036866
Number of partitions of n such that cn(0,5) = cn(1,5) = cn(3,5) <= cn(2,5) = cn(4,5).
Number of partitions of n such that cn(0,5) = cn(1,5) <= cn(3,5) < cn(2,5) = cn(4,5).A036867
Number of partitions of n such that cn(0,5) = cn(1,5) <= cn(3,5) < cn(2,5) = cn(4,5).
Number of partitions of n such that cn(3,5) <= cn(0,5) = cn(1,5) < cn(2,5) = cn(4,5).A036868
Number of partitions of n such that cn(3,5) <= cn(0,5) = cn(1,5) < cn(2,5) = cn(4,5).
Number of partitions of n such that cn(0,5) = cn(1,5) = cn(3,5) < cn(2,5) = cn(4,5).A036869
Number of partitions of n such that cn(0,5) = cn(1,5) = cn(3,5) < cn(2,5) = cn(4,5).
Number of partitions of n such that cn(0,5) = cn(1,5) < cn(2,5) = cn(4,5) <= cn(3,5).A036870
Number of partitions of n such that cn(0,5) = cn(1,5) < cn(2,5) = cn(4,5) <= cn(3,5).
Number of partitions of n such that cn(0,5) = cn(1,5) <= cn(2,5) = cn(3,5) = cn(4,5).A036871
Number of partitions of n such that cn(0,5) = cn(1,5) <= cn(2,5) = cn(3,5) = cn(4,5).
Number of partitions of n such that cn(0,5) = cn(1,5) < cn(3,5) <= cn(2,5) = cn(4,5).A036872
Number of partitions of n such that cn(0,5) = cn(1,5) < cn(3,5) <= cn(2,5) = cn(4,5).
Number of partitions of n such that cn(0,5) = cn(1,5) < cn(2,5) = cn(3,5) = cn(4,5).A036873
Number of partitions of n such that cn(0,5) = cn(1,5) < cn(2,5) = cn(3,5) = cn(4,5).
Number of partitions of n such that cn(0,5) = cn(1,5) < cn(2,5) = cn(4,5) < cn(3,5).A036874
Number of partitions of n such that cn(0,5) = cn(1,5) < cn(2,5) = cn(4,5) < cn(3,5).
Number of partitions of n such that cn(3,5) < cn(0,5) = cn(1,5) <= cn(2,5) = cn(4,5).A036875
Number of partitions of n such that cn(3,5) < cn(0,5) = cn(1,5) <= cn(2,5) = cn(4,5).
Number of partitions of n such that cn(0,5) = cn(1,5) < cn(3,5) < cn(2,5) = cn(4,5).A036876
Number of partitions of n such that cn(0,5) = cn(1,5) < cn(3,5) < cn(2,5) = cn(4,5).
Number of partitions of n such that cn(3,5) < cn(0,5) = cn(1,5) < cn(2,5) = cn(4,5).A036877
Number of partitions of n such that cn(3,5) < cn(0,5) = cn(1,5) < cn(2,5) = cn(4,5).
a(n) = p^(p-1) where p = prime(n).A036878
a(n) = p^(p-1) where p = prime(n).
If n = (p_1)^(m_1)...(p_k)^(m_k) then a(n) = (p_1)^((p_1)^(m_1) - 1)...(p_k)((p_k)^(m_k) - 1).A036879
If n = (p_1)^(m_1)...(p_k)^(m_k) then a(n) = (p_1)^((p_1)^(m_1) - 1)...(p_k)((p_k)^(m_k) - 1).
Number of partitions of 5n such that cn(0,5) <= cn(1,5) = cn(4,5) <= cn(2,5) = cn(3,5).A036880
Number of partitions of 5n such that cn(0,5) <= cn(1,5) = cn(4,5) <= cn(2,5) = cn(3,5).
Number of partitions of 5n such that cn(1,5) = cn(4,5) <= cn(0,5) <= cn(2,5) = cn(3,5).A036881
Number of partitions of 5n such that cn(1,5) = cn(4,5) <= cn(0,5) <= cn(2,5) = cn(3,5).
Number of partitions of 5n such that cn(1,5) = cn(4,5) <= cn(2,5) = cn(3,5) <= cn(0,5).A036882
Number of partitions of 5n such that cn(1,5) = cn(4,5) <= cn(2,5) = cn(3,5) <= cn(0,5).
Number of partitions of 5n such that cn(0,5) <= cn(1,5) = cn(4,5) < cn(2,5) = cn(3,5).A036883
Number of partitions of 5n such that cn(0,5) <= cn(1,5) = cn(4,5) < cn(2,5) = cn(3,5).
Number of partitions of 5n such that cn(0,5) = cn(1,5) = cn(4,5) <= cn(2,5) = cn(3,5).A036884
Number of partitions of 5n such that cn(0,5) = cn(1,5) = cn(4,5) <= cn(2,5) = cn(3,5).
Number of partitions of 5n such that cn(1,5) = cn(4,5) <= cn(0,5) < cn(2,5) = cn(3,5).A036885
Number of partitions of 5n such that cn(1,5) = cn(4,5) <= cn(0,5) < cn(2,5) = cn(3,5).
Number of partitions of 5n such that cn(0,5) = cn(1,5) = cn(4,5) < cn(2,5) = cn(3,5).A036886
Number of partitions of 5n such that cn(0,5) = cn(1,5) = cn(4,5) < cn(2,5) = cn(3,5).
Number of partitions of 5n such that cn(1,5) = cn(4,5) <= cn(2,5) = cn(3,5) < cn(0,5).A036887
Number of partitions of 5n such that cn(1,5) = cn(4,5) <= cn(2,5) = cn(3,5) < cn(0,5).
Number of partitions of 5n such that cn(0,5) < cn(1,5) = cn(4,5) <= cn(2,5) = cn(3,5).A036888
Number of partitions of 5n such that cn(0,5) < cn(1,5) = cn(4,5) <= cn(2,5) = cn(3,5).
Number of partitions of 5n such that cn(1,5) = cn(4,5) <= cn(0,5) = cn(2,5) = cn(3,5).A036889
Number of partitions of 5n such that cn(1,5) = cn(4,5) <= cn(0,5) = cn(2,5) = cn(3,5).
Number of partitions of 5n such that cn(1,5) = cn(4,5) < cn(0,5) <= cn(2,5) = cn(3,5).A036890
Number of partitions of 5n such that cn(1,5) = cn(4,5) < cn(0,5) <= cn(2,5) = cn(3,5).
Number of partitions of 5n such that cn(1,5) = cn(4,5) < cn(2,5) = cn(3,5) <= cn(0,5).A036891
Number of partitions of 5n such that cn(1,5) = cn(4,5) < cn(2,5) = cn(3,5) <= cn(0,5).
Number of partitions of 5n such that cn(1,5) = cn(4,5) < cn(0,5) = cn(2,5) = cn(3,5).A036892
Number of partitions of 5n such that cn(1,5) = cn(4,5) < cn(0,5) = cn(2,5) = cn(3,5).
Number of partitions of 5n such that cn(0,5) < cn(1,5) = cn(4,5) < cn(2,5) = cn(3,5).A036893
Number of partitions of 5n such that cn(0,5) < cn(1,5) = cn(4,5) < cn(2,5) = cn(3,5).
Number of partitions of 5n such that cn(1,5) = cn(4,5) < cn(0,5) < cn(2,5) = cn(3,5).A036894
Number of partitions of 5n such that cn(1,5) = cn(4,5) < cn(0,5) < cn(2,5) = cn(3,5).
Number of partitions of 5n such that cn(1,5) = cn(4,5) < cn(2,5) = cn(3,5) < cn(0,5).A036895
Number of partitions of 5n such that cn(1,5) = cn(4,5) < cn(2,5) = cn(3,5) < cn(0,5).
Odd refactorable numbers.A036896
Odd refactorable numbers.
Square root of odd refactorable numbers.A036897
Square root of odd refactorable numbers.
List of pairs of consecutive refactorable numbers.A036898
List of pairs of consecutive refactorable numbers.
Products of pairs of consecutive refactorable numbers.A036899
Products of pairs of consecutive refactorable numbers.
Scan decimal expansion of e until all n-digit strings have been seen; a(n) is last string seen.A036900
Scan decimal expansion of e until all n-digit strings have been seen; a(n) is last string seen.
Scan decimal expansion of log(2) until all n-digit strings have been seen; a(n) is last string seen.A036901
Scan decimal expansion of log(2) until all n-digit strings have been seen; a(n) is last string seen.
Scan decimal expansion of zeta(3) until all n-digit strings have been seen; a(n) is last string seen.A036902
Scan decimal expansion of zeta(3) until all n-digit strings have been seen; a(n) is last string seen.
Scan decimal expansion of Pi until all n-digit strings have been seen; a(n) is number of digits that must be scanned.A036903
Scan decimal expansion of Pi until all n-digit strings have been seen; a(n) is number of digits that must be scanned.
Scan decimal expansion of e until all n-digit strings have been seen; a(n) is number of digits that must be scanned.A036904
Scan decimal expansion of e until all n-digit strings have been seen; a(n) is number of digits that must be scanned.
Scan decimal expansion of log(2) until all n-digit strings have been seen; a(n) is number of digits that must be scanned.A036905
Scan decimal expansion of log(2) until all n-digit strings have been seen; a(n) is number of digits that must be scanned.
Scan decimal expansion of zeta(3) until all n-digit strings have been seen; a(n) is number of digits that must be scanned.A036906
Scan decimal expansion of zeta(3) until all n-digit strings have been seen; a(n) is number of digits that must be scanned.
Square refactorable numbers.A036907
Square refactorable numbers.
Number of different compact source directed animals with 1 point on the bottom line.A036908
Number of different compact source directed animals with 1 point on the bottom line.
a(n) = (2/3) * 4^n * binomial(3*n, n).A036909
a(n) = (2/3) * 4^n * binomial(3*n, n).
a(n) = (binomial(4*n, 2*n) + binomial(2*n, n)^2)/2.A036910
a(n) = (binomial(4*n, 2*n) + binomial(2*n, n)^2)/2.