Sequences
392,541 sequences
- Sprague-Grundy values for octal game .564.A071511
Sprague-Grundy values for octal game .564.
- Sprague-Grundy values for octal games .3707 and .37071.A071512
Sprague-Grundy values for octal games .3707 and .37071.
- Sprague-Grundy values for octal game .3737.A071513
Sprague-Grundy values for octal game .3737.
- Sprague-Grundy values for octal games .3777 and .37771.A071514
Sprague-Grundy values for octal games .3777 and .37771.
- Sprague-Grundy values for octal game .744.A071515
Sprague-Grundy values for octal game .744.
- Sprague-Grundy values for octal game .764.A071516
Sprague-Grundy values for octal game .764.
- Sprague-Grundy values for octal game .774.A071517
Sprague-Grundy values for octal game .774.
- Sprague-Grundy values for octal game .776.A071518
Sprague-Grundy values for octal game .776.
- Numbers whose square is a zeroless pandigital number (i.e., use the digits 1 through 9 once).A071519
Numbers whose square is a zeroless pandigital number (i.e., use the digits 1 through 9 once).
- Number of 5-smooth numbers (A051037) <= n.A071520
Number of 5-smooth numbers (A051037) <= n.
- Number of 3-smooth numbers <= n.A071521
Number of 3-smooth numbers <= n.
- Numbers n such that x^n + x^(n-1) + x^(n-2) + ... + x + 1 is irreducible over GF(5).A071522
Numbers n such that x^n + x^(n-1) + x^(n-2) + ... + x + 1 is irreducible over GF(5).
- Number of 11-smooth numbers <= n.A071523
Number of 11-smooth numbers <= n.
- Determinant of n X n matrix defined by m(i,j)=1 if i^2+j^2 is a prime, m(i,j)=0 otherwise.A071524
Determinant of n X n matrix defined by m(i,j)=1 if i^2+j^2 is a prime, m(i,j)=0 otherwise.
- Numbers n such that sigma(phi(n)) = reversal(n).A071525
Numbers n such that sigma(phi(n)) = reversal(n).
- Numbers k such that j mod phi(j) < k mod phi(k) for any j < k.A071526
Numbers k such that j mod phi(j) < k mod phi(k) for any j < k.
- Numbers k such that the simple continued fraction for (1+1/k)^k contains k.A071527
Numbers k such that the simple continued fraction for (1+1/k)^k contains k.
- Number of 1's among the elements of the simple continued fraction for e(n)=sum(k=1,n,1/k!).A071528
Number of 1's among the elements of the simple continued fraction for e(n)=sum(k=1,n,1/k!).
- Number of 1's among the elements of the simple continued fraction for (1+1/n)^n.A071529
Number of 1's among the elements of the simple continued fraction for (1+1/n)^n.
- Numbers that are the sum of 3 triangular numbers in exactly 2 ways.A071530
Numbers that are the sum of 3 triangular numbers in exactly 2 ways.
- Smallest exponent r such that n^r contains at least one zero digit (in base 10).A071531
Smallest exponent r such that n^r contains at least one zero digit (in base 10).
- a(n) = (-1) * Sum_{k=1..n} (-1)^floor((3/2)^k).A071532
a(n) = (-1) * Sum_{k=1..n} (-1)^floor((3/2)^k).
- Determinant of n X n matrix of form [1 2 3 0 0 0 0 0 0 0 / 2 1 2 3 0 0 0 0 0 0 / 3 2 1 2 3 0 0 0 0 0 / 0 3 2 1 2 3 0 0 0 0 / 0 0 3 2 1 2 3 0 0 0 / 0 0 0 3 2 1 2 3 0 0 / 0 0 0 0 3 2 1 2 3 0 / 0 0 0 0 0 3 2 1 2 3 / 0 0 0 0 0 0 3 2 1 2 / 0 0 0 0 0 0 0 3 2 1].A071533
Determinant of n X n matrix of form [1 2 3 0 0 0 0 0 0 0 / 2 1 2 3 0 0 0 0 0 0 / 3 2 1 2 3 0 0 0 0 0 / 0 3 2 1 2 3 0 0 0 0 / 0 0 3 2 1 2 3 0 0 0 / 0 0 0 3 2 1 2 3 0 0 / 0 0 0 0 3 2 1 2 3 0 / 0 0 0 0 0 3 2 1 2 3 / 0 0 0 0 0 0 3 2 1 2 / 0 0 0 0 0 0 0 3 2 1].
- Determinant of n X n matrix of form : [1 2 1 0 0 0 0 0 0 0 / 2 1 2 1 0 0 0 0 0 0 / 1 2 1 2 1 0 0 0 0 0 / 0 1 2 1 2 1 0 0 0 0 / 0 0 1 2 1 2 1 0 0 0 / 0 0 0 1 2 1 2 1 0 0 / 0 0 0 0 1 2 1 2 1 0 / 0 0 0 0 0 1 2 1 2 1 / 0 0 0 0 0 0 1 2 1 2 / 0 0 0 0 0 0 0 1 2 1].A071534
Determinant of n X n matrix of form : [1 2 1 0 0 0 0 0 0 0 / 2 1 2 1 0 0 0 0 0 0 / 1 2 1 2 1 0 0 0 0 0 / 0 1 2 1 2 1 0 0 0 0 / 0 0 1 2 1 2 1 0 0 0 / 0 0 0 1 2 1 2 1 0 0 / 0 0 0 0 1 2 1 2 1 0 / 0 0 0 0 0 1 2 1 2 1 / 0 0 0 0 0 0 1 2 1 2 / 0 0 0 0 0 0 0 1 2 1].
- (-1)^(n+1) * Determinant of n X n matrix of form [1^2 2^2 3^2 4^2 5^2 / 2^2 1^2 2^2 3^2 4^2 / 3^2 2^2 1^2 2^2 3^2 / 4^2 3^2 2^2 1^2 2^2 / 5^2 4^2 3^2 2^2 1^2].A071535
(-1)^(n+1) * Determinant of n X n matrix of form [1^2 2^2 3^2 4^2 5^2 / 2^2 1^2 2^2 3^2 4^2 / 3^2 2^2 1^2 2^2 3^2 / 4^2 3^2 2^2 1^2 2^2 / 5^2 4^2 3^2 2^2 1^2].
- Number of extensions to a semigroup of the (categorical) composition of arrows in the complete directed graph on n labeled nodes.A071536
Number of extensions to a semigroup of the (categorical) composition of arrows in the complete directed graph on n labeled nodes.
- Least integer m >= n such that there exist integers k_n, k_n+1, ..., k_m with nonzero k_n, for which n^(k_n) * (n+1)^(k_n+1) * ... * m^(k_m) = 1.A071537
Least integer m >= n such that there exist integers k_n, k_n+1, ..., k_m with nonzero k_n, for which n^(k_n) * (n+1)^(k_n+1) * ... * m^(k_m) = 1.
- Number of twin prime pairs (p, p+2) with p <= n.A071538
Number of twin prime pairs (p, p+2) with p <= n.
- Number of n-tuples of elements e_1,e_2,...,e_n in the symmetric group S_3 such that the subgroup generated by e_1,e_2,...,e_n is S_3.A071539
Number of n-tuples of elements e_1,e_2,...,e_n in the symmetric group S_3 such that the subgroup generated by e_1,e_2,...,e_n is S_3.
- Number of k's less than or equal to 10^n such that there are no middle divisors of k (A071561).A071540
Number of k's less than or equal to 10^n such that there are no middle divisors of k (A071561).
- Number of k's less than or equal to 10^n such that there are middle divisors of k (A071562).A071541
Number of k's less than or equal to 10^n such that there are middle divisors of k (A071562).
- Number of steps to reach 0 starting with n and using the iterated process : x -> x - (number of 1's in binary representation of x).A071542
Number of steps to reach 0 starting with n and using the iterated process : x -> x - (number of 1's in binary representation of x).
- a(n) = det M_n where M_n is the n X n matrix m(i,j) = prime(i+j); a(0) = 1 by convention.A071543
a(n) = det M_n where M_n is the n X n matrix m(i,j) = prime(i+j); a(0) = 1 by convention.
- Smallest k such that n+k divides (k+1)!-k!.A071544
Smallest k such that n+k divides (k+1)!-k!.
- Smallest k such that n+k divides (k+1)!+k!.A071545
Smallest k such that n+k divides (k+1)!+k!.
- Smallest integer > 1 of the form (k^2+1)/(n^2+1).A071546
Smallest integer > 1 of the form (k^2+1)/(n^2+1).
- Determinant of the n X n matrix whose element (i,j) equals f(|i-j|) where f(n) is the sum of middle divisors (A071090).A071547
Determinant of the n X n matrix whose element (i,j) equals f(|i-j|) where f(n) is the sum of middle divisors (A071090).
- Determinant of the n X n matrix whose element (i,j) equals f(|i-j|) where f(n) is 1 if the sum of middle divisors (A071090) > 0, else 0.A071548
Determinant of the n X n matrix whose element (i,j) equals f(|i-j|) where f(n) is 1 if the sum of middle divisors (A071090) > 0, else 0.
- a(n) = (7n)!/n!^7.A071549
a(n) = (7n)!/n!^7.
- a(n) = (8n)!/n!^8.A071550
a(n) = (8n)!/n!^8.
- a(n) = (9n)!/n!^9.A071551
a(n) = (9n)!/n!^9.
- a(n) = (10n)!/n!^10.A071552
a(n) = (10n)!/n!^10.
- Least x greater than 1 such that x^n == 1 (mod i) for each i=1,2,3,...,n.A071553
Least x greater than 1 such that x^n == 1 (mod i) for each i=1,2,3,...,n.
- Smallest x > 1 such that x^prime(n) == 1 mod(prime(i)) 2<=i<=n.A071554
Smallest x > 1 such that x^prime(n) == 1 mod(prime(i)) 2<=i<=n.
- Smallest x > 1 such that x^prime(n) == 1 mod(prime(i)) 3<=i<=n.A071555
Smallest x > 1 such that x^prime(n) == 1 mod(prime(i)) 3<=i<=n.
- Smallest x > 1 such that x^prime(n) == 1 mod(prime(i)) 4<=i<=n.A071556
Smallest x > 1 such that x^prime(n) == 1 mod(prime(i)) 4<=i<=n.
- Numbers k such that A065876(k) = k^2-k+1.A071557
Numbers k such that A065876(k) = k^2-k+1.
- Smallest k such that n*k + 1 and n*k - 1 are twin primes.A071558
Smallest k such that n*k + 1 and n*k - 1 are twin primes.
- Smallest k such that n + k and n^2 + k^2 are simultaneously primes.A071559
Smallest k such that n + k and n^2 + k^2 are simultaneously primes.
- Smallest k such that n^4+k^4, n^2+k^2, n+k are simultaneously primes.A071560
Smallest k such that n^4+k^4, n^2+k^2, n+k are simultaneously primes.