Sequences
392,541 sequences
- Least number of the form x^2 + y^3 (x, y nonnegative) in exactly n ways.A060861
Least number of the form x^2 + y^3 (x, y nonnegative) in exactly n ways.
- a(n) = 0 if n is deficient, 1 if n is abundant, 2 if n is perfect.A060862
a(n) = 0 if n is deficient, 1 if n is abundant, 2 if n is perfect.
- Positive numbers n which are the average of a run of consecutive primes.A060863
Positive numbers n which are the average of a run of consecutive primes.
- Positive integers that are not an average of consecutive primes.A060864
Positive integers that are not an average of consecutive primes.
- a(n) is the exact power of 2 that divides the n-th Fibonacci number (A000045).A060865
a(n) is the exact power of 2 that divides the n-th Fibonacci number (A000045).
- Sum of (d+d') over all unordered pairs (d,d') with d*d' = n.A060866
Sum of (d+d') over all unordered pairs (d,d') with d*d' = n.
- a(n) = (2^n - 1)^2.A060867
a(n) = (2^n - 1)^2.
- Number of n X n matrices over GF(3) with rank 1.A060868
Number of n X n matrices over GF(3) with rank 1.
- Number of n X n matrices over GF(4) with rank 1.A060869
Number of n X n matrices over GF(4) with rank 1.
- Number of n X n matrices over GF(5) with rank 1.A060870
Number of n X n matrices over GF(5) with rank 1.
- Number of n X n matrices over GF(7) with rank 1.A060871
Number of n X n matrices over GF(7) with rank 1.
- Sum of d*d' over all unordered pairs (d,d') with d*d' = n.A060872
Sum of d*d' over all unordered pairs (d,d') with d*d' = n.
- Intrinsic 3-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.A060873
Intrinsic 3-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.
- Intrinsic 4-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.A060874
Intrinsic 4-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.
- Intrinsic 5-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.A060875
Intrinsic 5-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.
- Intrinsic 6-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.A060876
Intrinsic 6-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.
- Intrinsic 7-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.A060877
Intrinsic 7-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.
- Intrinsic 8-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.A060878
Intrinsic 8-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.
- Intrinsic 9-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.A060879
Intrinsic 9-palindromes: n is an intrinsic k-palindrome if it is a k-digit palindrome in some base.
- Compositorial numbers (A036691) - 1.A060880
Compositorial numbers (A036691) - 1.
- n-th primorial (A002110) + prime(n + 1).A060881
n-th primorial (A002110) + prime(n + 1).
- a(n) = n-th primorial (A002110) minus next prime.A060882
a(n) = n-th primorial (A002110) minus next prime.
- a(n) = n^6 + n^3 + 1.A060883
a(n) = n^6 + n^3 + 1.
- a(n) = n^4 - n^3 + n^2 - n + 1.A060884
a(n) = n^4 - n^3 + n^2 - n + 1.
- a(n) = Sum_{j=0..10} n^j.A060885
a(n) = Sum_{j=0..10} n^j.
- a(n) = n^4 - n^2 + 1.A060886
a(n) = n^4 - n^2 + 1.
- a(n) = Sum_{j=0..12} n^j.A060887
a(n) = Sum_{j=0..12} n^j.
- a(n) = n^6 - n^5 + n^4 - n^3 + n^2 - n + 1.A060888
a(n) = n^6 - n^5 + n^4 - n^3 + n^2 - n + 1.
- a(n) = n^8 - n^7 + n^5 - n^4 + n^3 - n + 1.A060889
a(n) = n^8 - n^7 + n^5 - n^4 + n^3 - n + 1.
- a(n) = n^8 + 1.A060890
a(n) = n^8 + 1.
- a(n) = n^6 - n^3 + 1.A060891
a(n) = n^6 - n^3 + 1.
- a(n) = n^8 - n^6 + n^4 - n^2 + 1.A060892
a(n) = n^8 - n^6 + n^4 - n^2 + 1.
- a(n) = n^8 - n^4 + 1.A060893
a(n) = n^8 - n^4 + 1.
- a(n) = n^8 + n^7 - n^5 - n^4 - n^3 + n + 1.A060894
a(n) = n^8 + n^7 - n^5 - n^4 - n^3 + n + 1.
- a(n) = n^16 + 1.A060895
a(n) = n^16 + 1.
- a(n) = n^12 - n^6 + 1.A060896
a(n) = n^12 - n^6 + 1.
- Number of walks of length n on square lattice, starting at origin, staying in first and third quadrants.A060897
Number of walks of length n on square lattice, starting at origin, staying in first and third quadrants.
- Number of walks of length n on square lattice, starting at origin, staying in first, second and third quadrants.A060898
Number of walks of length n on square lattice, starting at origin, staying in first, second and third quadrants.
- Number of walks of length n on square lattice, starting at origin, staying on points with x+y >= 0.A060899
Number of walks of length n on square lattice, starting at origin, staying on points with x+y >= 0.
- Number of walks of length n on square lattice, starting at origin, staying on points with x >= 0, y <= x.A060900
Number of walks of length n on square lattice, starting at origin, staying on points with x >= 0, y <= x.
- Exact power of 3 that divides the n-th Fibonacci number (sequence A000045).A060901
Exact power of 3 that divides the n-th Fibonacci number (sequence A000045).
- Number of ordered factorizations of the identity permutation in the symmetric group S_n into 2n-2 transpositions such that the factors generate S_n.A060902
Number of ordered factorizations of the identity permutation in the symmetric group S_n into 2n-2 transpositions such that the factors generate S_n.
- a(n) = floor(6*n*sqrt(n)/Pi^2).A060903
a(n) = floor(6*n*sqrt(n)/Pi^2).
- Largest power of 5 that divides n.A060904
Largest power of 5 that divides n.
- Expansion of e.g.f. exp(x*exp(x) + 1/2*x^2*exp(x)^2).A060905
Expansion of e.g.f. exp(x*exp(x) + 1/2*x^2*exp(x)^2).
- E.g.f.: exp(x*exp(x) + 1/3*x^3*exp(x)^3).A060906
E.g.f.: exp(x*exp(x) + 1/3*x^3*exp(x)^3).
- E.g.f.: exp(x*exp(x) + 1/2*x^2*exp(x)^2 + 1/4*x^4*exp(x)^4).A060907
E.g.f.: exp(x*exp(x) + 1/2*x^2*exp(x)^2 + 1/4*x^4*exp(x)^4).
- E.g.f.: exp(x*exp(x*exp(x)) + 1/2*x^2*exp(x*exp(x))^2).A060908
E.g.f.: exp(x*exp(x*exp(x)) + 1/2*x^2*exp(x*exp(x))^2).
- E.g.f.: exp(x*exp(x*exp(x)) + 1/3*x^3*exp(x*exp(x))^3).A060909
E.g.f.: exp(x*exp(x*exp(x)) + 1/3*x^3*exp(x*exp(x))^3).
- E.g.f.: exp(x*exp(x*exp(x)) + 1/2*x^2*exp(x*exp(x))^2 + 1/4*x^4*exp(x*exp(x))^4).A060910
E.g.f.: exp(x*exp(x*exp(x)) + 1/2*x^2*exp(x*exp(x))^2 + 1/4*x^4*exp(x*exp(x))^4).