Sequences
392,541 sequences
- Numbers k such that k*4^k-1 is prime.A086661
Numbers k such that k*4^k-1 is prime.
- Stirling transform of Catalan numbers: Sum_{k=0..n} |Stirling1(n, k)|*binomial(2*k, k)/(k+1).A086662
Stirling transform of Catalan numbers: Sum_{k=0..n} |Stirling1(n, k)|*binomial(2*k, k)/(k+1).
- Number of non-attacking knights on an n X n board with all non-perimeteral squares removed.A086663
Number of non-attacking knights on an n X n board with all non-perimeteral squares removed.
- a(n) = n - (sum of prime power components of n).A086664
a(n) = n - (sum of prime power components of n).
- Difference between sum of divisors of n and integer log of n, i.e., A000203(n) - A001414(n).A086665
Difference between sum of divisors of n and integer log of n, i.e., A000203(n) - A001414(n).
- a(n) = sigma_2(n) - sigma_1(n).A086666
a(n) = sigma_2(n) - sigma_1(n).
- Triangular array, read by rows: T(n,k) = greatest decimal number of length k contained as a string in the first n positions of the decimal expansion of Pi, 1 <= k <= n.A086667
Triangular array, read by rows: T(n,k) = greatest decimal number of length k contained as a string in the first n positions of the decimal expansion of Pi, 1 <= k <= n.
- Number of divisors d of n such that 2d+1 is a prime.A086668
Number of divisors d of n such that 2d+1 is a prime.
- a(n) = number of divisors of n that are fundamental discriminants.A086669
a(n) = number of divisors of n that are fundamental discriminants.
- Sum of floor(d/2) where d is a divisor of n.A086670
Sum of floor(d/2) where d is a divisor of n.
- Sum of floor(sqrt(d)) where d runs through the divisors of n.A086671
Sum of floor(sqrt(d)) where d runs through the divisors of n.
- Stirling1 transform of Catalan numbers: Sum_{k=0..n} Stirling1(n,k)*binomial(2*k,k)/(k+1).A086672
Stirling1 transform of Catalan numbers: Sum_{k=0..n} Stirling1(n,k)*binomial(2*k,k)/(k+1).
- Number of right-truncatable semiprimes <= n.A086673
Number of right-truncatable semiprimes <= n.
- Sum of signed indices from Euler's Pentagonal Theorem (see A000041).A086674
Sum of signed indices from Euler's Pentagonal Theorem (see A000041).
- Number of n X n (0,1)-matrices modulo cyclic permutations of the rows.A086675
Number of n X n (0,1)-matrices modulo cyclic permutations of the rows.
- Number of n-dimensional 2 X 2 X ... X 2 grid graphs needed to cover an n-dimensional 3 X 3 X ... X 3 torus.A086676
Number of n-dimensional 2 X 2 X ... X 2 grid graphs needed to cover an n-dimensional 3 X 3 X ... X 3 torus.
- Number of Steiner topologies on n points.A086677
Number of Steiner topologies on n points.
- Numbers n such that 1 + Sum_{k=1..n} 2k^5 is a prime.A086678
Numbers n such that 1 + Sum_{k=1..n} 2k^5 is a prime.
- Duplicate of A019508.A086679
Duplicate of A019508.
- Number of primes < 4^n.A086680
Number of primes < 4^n.
- Number of primes < 8^n.A086681
Number of primes < 8^n.
- Number of primes < 9^n.A086682
Number of primes < 9^n.
- Number of n X n {-1,0,1} matrices modulo cyclic permutations of the rows.A086683
Number of n X n {-1,0,1} matrices modulo cyclic permutations of the rows.
- a(n) = n! - Sum_{i} p_i!^e_i, where n = Product_{i} (p_i^e_i).A086684
a(n) = n! - Sum_{i} p_i!^e_i, where n = Product_{i} (p_i^e_i).
- Number of 1 <= i < n such that i*n+1 is prime.A086685
Number of 1 <= i < n such that i*n+1 is prime.
- Number of 1<=i<n such that i*n-1 is prime.A086686
Number of 1<=i<n such that i*n-1 is prime.
- a(n) = binomial(n!,n).A086687
a(n) = binomial(n!,n).
- Number of primes < prime(n)^3.A086688
Number of primes < prime(n)^3.
- a(n) = Sum_{i=1..n} i^2*t(i), where t = A000217.A086689
a(n) = Sum_{i=1..n} i^2*t(i), where t = A000217.
- Number of primes < 2^prime(n).A086690
Number of primes < 2^prime(n).
- Numbers n such that all of {n, pi(n), prime(n)} have the same decimal digits (ignoring multiplicity).A086691
Numbers n such that all of {n, pi(n), prime(n)} have the same decimal digits (ignoring multiplicity).
- Number of primes < 3^prime(n).A086692
Number of primes < 3^prime(n).
- Number of primes less than prime(n)^prime(n).A086693
Number of primes less than prime(n)^prime(n).
- A run of 2^n 1's followed by a run of 2^n 0's, for n=0, 1, 2, ...A086694
A run of 2^n 1's followed by a run of 2^n 0's, for n=0, 1, 2, ...
- a(n) = 100^n - 10^n - 1.A086695
a(n) = 100^n - 10^n - 1.
- Least k such that A056830(n) + k is semiprime, where A056830 = alternate digits 1 and 0.A086696
Least k such that A056830(n) + k is semiprime, where A056830 = alternate digits 1 and 0.
- Left-truncatable semiprimes, i.e., semiprimes in which repeatedly deleting the leftmost digit gives a semiprime at every step until a single-digit semiprime remains.A086697
Left-truncatable semiprimes, i.e., semiprimes in which repeatedly deleting the leftmost digit gives a semiprime at every step until a single-digit semiprime remains.
- Two-sided semiprimes: deleting any number of digits at left or at right, but not both, leaves a semiprime.A086698
Two-sided semiprimes: deleting any number of digits at left or at right, but not both, leaves a semiprime.
- Number of n X n matrices over GF(2) with rank n-1.A086699
Number of n X n matrices over GF(2) with rank n-1.
- Euler phi function applied to the triangular numbers.A086700
Euler phi function applied to the triangular numbers.
- n-th prime number raised to the n-th composite number.A086701
n-th prime number raised to the n-th composite number.
- Decimal expansion of Lévy's constant.A086702
Decimal expansion of Lévy's constant.
- Continued fraction expansion of Levy's constant.A086703
Continued fraction expansion of Levy's constant.
- Greater of the twin primes raised to their lesser twins.A086704
Greater of the twin primes raised to their lesser twins.
- Decimal expansion of a constant related to Niven numbers.A086705
Decimal expansion of a constant related to Niven numbers.
- Number of Niven numbers less than or equal to n.A086706
Number of Niven numbers less than or equal to n.
- Smallest mode of the sequences n/(n-k)*binomial(n,n-k) (see link).A086707
Smallest mode of the sequences n/(n-k)*binomial(n,n-k) (see link).
- Primes p such that p-1 and p+1 are both divisible by cubes (other than 1).A086708
Primes p such that p-1 and p+1 are both divisible by cubes (other than 1).
- Primes p such that p-1 and p+1 are both divisible by fourth powers.A086709
Primes p such that p-1 and p+1 are both divisible by fourth powers.
- Position on a standard U.S. keyboard where the n-th letter of the alphabet can be found.A086710
Position on a standard U.S. keyboard where the n-th letter of the alphabet can be found.