Sequences
392,541 sequences
- Main diagonal of A018219, i.e., (n, n, a_n) is a winning position.A051261
Main diagonal of A018219, i.e., (n, n, a_n) is a winning position.
- 10-factorial numbers.A051262
10-factorial numbers.
- Expansion of 1/((1-x)*(1-x^3)^2*(1-x^5)).A051263
Expansion of 1/((1-x)*(1-x^3)^2*(1-x^5)).
- Numbers that are 1-persistent but not 2-persistent.A051264
Numbers that are 1-persistent but not 2-persistent.
- Maximal value of prime divisors of numbers in reduced residue system for n.A051265
Maximal value of prime divisors of numbers in reduced residue system for n.
- Numbers n such that maximal value of prime divisors of reduced residue system for n is 2.A051266
Numbers n such that maximal value of prime divisors of reduced residue system for n is 2.
- Numbers n such that maximal value of prime divisors of reduced residue system for n is 3.A051267
Numbers n such that maximal value of prime divisors of reduced residue system for n is 3.
- Numbers n such that maximal value of prime divisors of reduced residue system for n is 4.A051268
Numbers n such that maximal value of prime divisors of reduced residue system for n is 4.
- Number of self-complementary 3-place relations on a 2n-element set.A051269
Number of self-complementary 3-place relations on a 2n-element set.
- Numbers that are divisible by exactly 5 different primes.A051270
Numbers that are divisible by exactly 5 different primes.
- Number of numbers either relatively prime to or divisors of primorial number(n).A051271
Number of numbers either relatively prime to or divisors of primorial number(n).
- Number of numbers neither relatively prime to nor divisors of primorial number(n).A051272
Number of numbers neither relatively prime to nor divisors of primorial number(n).
- Expansion of q^(-1/3) * b(q) * c(q) / a(q)^2 in powers of q where a(), b(), c() are cubic AGM theta functions.A051273
Expansion of q^(-1/3) * b(q) * c(q) / a(q)^2 in powers of q where a(), b(), c() are cubic AGM theta functions.
- Expansion of (1+x^4)/((1-x^2)*(1-x^3)).A051274
Expansion of (1+x^4)/((1-x^2)*(1-x^3)).
- Expansion of (1+x^2)/((1-x^2)*(1-x^3)).A051275
Expansion of (1+x^2)/((1-x^2)*(1-x^3)).
- Nonzero coefficients in one of the 5-adic expansions of sqrt(-1).A051276
Nonzero coefficients in one of the 5-adic expansions of sqrt(-1).
- Coefficients in 7-adic expansion of sqrt(2).A051277
Coefficients in 7-adic expansion of sqrt(2).
- Numbers n such that n = k/d(k) has a unique solution, where d(k) = number of divisors of k.A051278
Numbers n such that n = k/d(k) has a unique solution, where d(k) = number of divisors of k.
- Numbers n such that n = k/d(k) has exactly 2 solutions, where d(k) = number of divisors of k.A051279
Numbers n such that n = k/d(k) has exactly 2 solutions, where d(k) = number of divisors of k.
- Numbers n such that n = k/d(k) has exactly 3 solutions, where d(k) = number of divisors of k.A051280
Numbers n such that n = k/d(k) has exactly 3 solutions, where d(k) = number of divisors of k.
- Sum of divisors of n, sigma(n) (A000203), is a power of number of divisors of n, d(n) (A000005).A051281
Sum of divisors of n, sigma(n) (A000203), is a power of number of divisors of n, d(n) (A000005).
- 2-adic valuation of A025487: largest k such that 2^k divides A025487(n), where A025487 gives products of primorials.A051282
2-adic valuation of A025487: largest k such that 2^k divides A025487(n), where A025487 gives products of primorials.
- Numbers k such that if one writes k = Product p_i^e_i (p_i primes) and P = max p_i^e_i, then k/P > P.A051283
Numbers k such that if one writes k = Product p_i^e_i (p_i primes) and P = max p_i^e_i, then k/P > P.
- a(n) is the number k, 2^n < k < 2^(n+1), such that k/c(k) is a minimum in the interval, where c(k) is Hofstadter-Conway sequence A004001.A051284
a(n) is the number k, 2^n < k < 2^(n+1), such that k/c(k) is a minimum in the interval, where c(k) is Hofstadter-Conway sequence A004001.
- a(1) = 1, a(2) = 2, a(n) = a(n-1)^a(n-2).A051285
a(1) = 1, a(2) = 2, a(n) = a(n-1)^a(n-2).
- Whitney number of level n of the lattice of the ideals of the fence of order 2n.A051286
Whitney number of level n of the lattice of the ideals of the fence of order 2n.
- Triangular array T read by rows: T(n,k)=P(n,k,|n-2k|), where P(n,k,c)=number of vectors (x(1),x(2,),...,x(n)) of k 1's and n-k 0's such that x(i)=x(n+1-i) for exactly c values of i.A051287
Triangular array T read by rows: T(n,k)=P(n,k,|n-2k|), where P(n,k,c)=number of vectors (x(1),x(2,),...,x(n)) of k 1's and n-k 0's such that x(i)=x(n+1-i) for exactly c values of i.
- Triangle read by rows: T(n,k) = number of paths of n upsteps U and n downsteps D that contain k UUDs.A051288
Triangle read by rows: T(n,k) = number of paths of n upsteps U and n downsteps D that contain k UUDs.
- Triangular array T read by rows: T(n,k)=P(2n+1,n,2k+1), where P(n,k,c)=number of vectors (x(1),x(2,),...,x(n)) of k 1's and n-k 0's such that x(i)=x(n+1-i) for exactly c values of i.A051289
Triangular array T read by rows: T(n,k)=P(2n+1,n,2k+1), where P(n,k,c)=number of vectors (x(1),x(2,),...,x(n)) of k 1's and n-k 0's such that x(i)=x(n+1-i) for exactly c values of i.
- Triangular array T read by rows: T(n,k)=P(2n+3,n,2k+3), where P(n,k,c)=number of vectors (x(1),x(2,),...,x(n)) of k 1's and n-k 0's such that x(i)=x(n+1-i) for exactly c values of i.A051290
Triangular array T read by rows: T(n,k)=P(2n+3,n,2k+3), where P(n,k,c)=number of vectors (x(1),x(2,),...,x(n)) of k 1's and n-k 0's such that x(i)=x(n+1-i) for exactly c values of i.
- Whitney number of level n of the lattice of the ideals of the fence of order 2 n + 1.A051291
Whitney number of level n of the lattice of the ideals of the fence of order 2 n + 1.
- Whitney number of level n of the lattice of the ideals of the crown of size 2 n.A051292
Whitney number of level n of the lattice of the ideals of the crown of size 2 n.
- Number of nonempty subsets of {1,2,3,...,n} whose elements have an integer average.A051293
Number of nonempty subsets of {1,2,3,...,n} whose elements have an integer average.
- a(n) = F(n^2)/F(n), where F(n) = A000045(n) is the n-th Fibonacci number.A051294
a(n) = F(n^2)/F(n), where F(n) = A000045(n) is the n-th Fibonacci number.
- a(0)=1; thereafter, a(m+1) = Sum_{k=0..m} k!*a(m-k).A051295
a(0)=1; thereafter, a(m+1) = Sum_{k=0..m} k!*a(m-k).
- INVERT transform of factorial numbers.A051296
INVERT transform of factorial numbers.
- (Terms in A028266)/2.A051297
(Terms in A028266)/2.
- (Terms in A028273)/2.A051298
(Terms in A028273)/2.
- a(n) = a(n-1) + rotate( a(n-1), 1 digit left), a(1) = 1.A051299
a(n) = a(n-1) + rotate( a(n-1), 1 digit left), a(1) = 1.
- a(n) = a(n-1) + rotate( a(n-1), 1 digit right), a(1) = 1.A051300
a(n) = a(n-1) + rotate( a(n-1), 1 digit right), a(1) = 1.
- Smallest prime factor of n!+1.A051301
Smallest prime factor of n!+1.
- Numbers whose square can be expressed as the sum of two positive cubes in more than one way.A051302
Numbers whose square can be expressed as the sum of two positive cubes in more than one way.
- Number of 3-element proper antichains of an n-element set.A051303
Number of 3-element proper antichains of an n-element set.
- Number of 4-element proper antichains of an n-element set.A051304
Number of 4-element proper antichains of an n-element set.
- Number of 5-element proper antichains of an n-element set.A051305
Number of 5-element proper antichains of an n-element set.
- Number of 6-element proper antichains of an n-element set.A051306
Number of 6-element proper antichains of an n-element set.
- Number of 7-element proper antichains of an n-element set.A051307
Number of 7-element proper antichains of an n-element set.
- Euclid-Mullin sequence (A000945) with initial value a(1)=5 instead of a(1)=2.A051308
Euclid-Mullin sequence (A000945) with initial value a(1)=5 instead of a(1)=2.
- Euclid-Mullin sequence (A000945) with initial value a(1)=11 instead of a(1)=2.A051309
Euclid-Mullin sequence (A000945) with initial value a(1)=11 instead of a(1)=2.
- Euclid-Mullin sequence (A000945) with initial value a(1)=13 instead of a(1)=2.A051310
Euclid-Mullin sequence (A000945) with initial value a(1)=13 instead of a(1)=2.