Sequences
392,541 sequences
- Denominators of Pi-dependent part of even terms in the probability of obtaining an acute triangle by picking n points at random in the unit n-ball.A093761
Denominators of Pi-dependent part of even terms in the probability of obtaining an acute triangle by picking n points at random in the unit n-ball.
- Numerators of 1-2*HarmonicNumber(n)/(n+1).A093762
Numerators of 1-2*HarmonicNumber(n)/(n+1).
- Duplicate of A002548.A093763
Duplicate of A002548.
- Hook products of all partitions of 6.A093764
Hook products of all partitions of 6.
- Numbers k such that 6^k+5^(k-1) is prime.A093765
Numbers k such that 6^k+5^(k-1) is prime.
- Decimal expansion of Pi/(2*sqrt(3)).A093766
Decimal expansion of Pi/(2*sqrt(3)).
- Decimal expansion of (8 - 4*sqrt(2) - log(2))/(-1 + 2*sqrt(2)).A093767
Decimal expansion of (8 - 4*sqrt(2) - log(2))/(-1 + 2*sqrt(2)).
- Positive first differences of the rows of triangle A088459, which enumerates symmetric Dyck paths.A093768
Positive first differences of the rows of triangle A088459, which enumerates symmetric Dyck paths.
- Hook products of all partitions of 7.A093769
Hook products of all partitions of 7.
- Non-perfect powers k for which q = A051903(k)/A051904(k) is an integer, A051904(k) > 1.A093770
Non-perfect powers k for which q = A051903(k)/A051904(k) is an integer, A051904(k) > 1.
- Perfect powers for which the exponent is a prime number: solutions to {A051409(x) is prime}.A093771
Perfect powers for which the exponent is a prime number: solutions to {A051409(x) is prime}.
- a(n) is the smallest integer at which the value of the "truncated Mertens function" (= A088004) equals n.A093772
a(n) is the smallest integer at which the value of the "truncated Mertens function" (= A088004) equals n.
- a(n) is the smallest integer at which the value of the "truncated Mertens function" (= A088004) equals the n-th prime number.A093773
a(n) is the smallest integer at which the value of the "truncated Mertens function" (= A088004) equals the n-th prime number.
- Smallest integers at which the value of truncated Mertens function equals n!.A093774
Smallest integers at which the value of truncated Mertens function equals n!.
- Smallest integers at which the value of truncated Mertens function equals the n-th primorial, the product of first n prime numbers.A093775
Smallest integers at which the value of truncated Mertens function equals the n-th primorial, the product of first n prime numbers.
- Smallest integer at which the value of truncated Mertens function equals 2^n.A093776
Smallest integer at which the value of truncated Mertens function equals 2^n.
- a(n) is the smallest prime which, if used to start a Euclid-Mullin sequence (like A000945), the resulting sequence contains the n consecutive primes 2, 3, ..., prime(n).A093777
a(n) is the smallest prime which, if used to start a Euclid-Mullin sequence (like A000945), the resulting sequence contains the n consecutive primes 2, 3, ..., prime(n).
- Primes p used as initial values for Euclid-Mullin sequences (variant A000945) instead of 2, such that all provide {p,2,3,5,7,11,13,q,...} initial segments in which the first six primes occur from 2nd to 7th terms.A093778
Primes p used as initial values for Euclid-Mullin sequences (variant A000945) instead of 2, such that all provide {p,2,3,5,7,11,13,q,...} initial segments in which the first six primes occur from 2nd to 7th terms.
- a(n) is the position of prime 3 in the Euclid-Mullin (EM) sequence of type A000945, if it were started with prime(n) instead of 2.A093779
a(n) is the position of prime 3 in the Euclid-Mullin (EM) sequence of type A000945, if it were started with prime(n) instead of 2.
- a(n) is the smallest prime used as initial value for Euclid-Mullin (EM) sequence (of variant A000945), such that in the corresponding EM-sequence the p=3 prime arises at the n-th position.A093780
a(n) is the smallest prime used as initial value for Euclid-Mullin (EM) sequence (of variant A000945), such that in the corresponding EM-sequence the p=3 prime arises at the n-th position.
- a(n) is the position of the prime 5 in the Euclid-Mullin (EM) sequence of type A000945, if it were started with prime(n) instead of 2.A093781
a(n) is the position of the prime 5 in the Euclid-Mullin (EM) sequence of type A000945, if it were started with prime(n) instead of 2.
- a(n) is the smallest initial value (a prime) for the Euclid-Mullin (EM) sequence in which the p=5 prime emerges as n-th term, i.e., arises at the n-th position.A093782
a(n) is the smallest initial value (a prime) for the Euclid-Mullin (EM) sequence in which the p=5 prime emerges as n-th term, i.e., arises at the n-th position.
- Sum of digits of n in Roman numeral representation.A093783
Sum of digits of n in Roman numeral representation.
- Triangle T(n,k) read by rows in which n-th row gives the hook products of the partitions of n.A093784
Triangle T(n,k) read by rows in which n-th row gives the hook products of the partitions of n.
- Numbers that are divisible by every digit in their Roman numeral representation.A093785
Numbers that are divisible by every digit in their Roman numeral representation.
- Hook products of all partitions of 8.A093786
Hook products of all partitions of 8.
- Hook products of all partitions of 9.A093787
Hook products of all partitions of 9.
- The Roman numerals, with "i" replaced by "1", "v" replaced by "5", "x" replaced by 10, etc.A093788
The Roman numerals, with "i" replaced by "1", "v" replaced by "5", "x" replaced by 10, etc.
- Hook products of all partitions of 10.A093789
Hook products of all partitions of 10.
- Hook products of all partitions of 11.A093790
Hook products of all partitions of 11.
- Hook products of all partitions of 12.A093791
Hook products of all partitions of 12.
- Hook products of all partitions of 13.A093792
Hook products of all partitions of 13.
- Numbers n such that 5^n+4^(n-1) is prime.A093793
Numbers n such that 5^n+4^(n-1) is prime.
- Numbers n such that 8^n+7^(n-1) is prime.A093794
Numbers n such that 8^n+7^(n-1) is prime.
- Numbers k such that 9^k + 8^(k-1) is prime.A093795
Numbers k such that 9^k + 8^(k-1) is prime.
- Sequence of digit-values after concatenating the natural numbers < 4000 in Roman numeral representation.A093796
Sequence of digit-values after concatenating the natural numbers < 4000 in Roman numeral representation.
- In the sequence of prime powers (A000961), replace perfect powers with their repeating factors.A093797
In the sequence of prime powers (A000961), replace perfect powers with their repeating factors.
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 45.A093798
a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 45.
- a(1) = 1; a(n+1) is the smallest triangular number such that the greatest common divisor gcd(a(n+1), a(n)) is a triangular number itself.A093799
a(1) = 1; a(n+1) is the smallest triangular number such that the greatest common divisor gcd(a(n+1), a(n)) is a triangular number itself.
- Triangular numbers such that the least common multiple of a pair of successive terms is triangular.A093800
Triangular numbers such that the least common multiple of a pair of successive terms is triangular.
- a(n) = b(n)*Integral_{x=0..1/(4^n)} (1 - sqrt(x)) dx, where b(n) = 3*24^n.A093801
a(n) = b(n)*Integral_{x=0..1/(4^n)} (1 - sqrt(x)) dx, where b(n) = 3*24^n.
- Number of distinct factorizations of 105*2^n.A093802
Number of distinct factorizations of 105*2^n.
- Greatest odd proper divisor of n; a(1)=1.A093803
Greatest odd proper divisor of n; a(1)=1.
- Primes p such that p! + 1 is also prime.A093804
Primes p such that p! + 1 is also prime.
- Numbers n with property that sum of digits is prime and number of prime digits is prime.A093805
Numbers n with property that sum of digits is prime and number of prime digits is prime.
- Primes n with property that sum of digits is prime and number of prime digits is prime.A093806
Primes n with property that sum of digits is prime and number of prime digits is prime.
- Palindromic numbers with property that sum of digits is prime and number of prime digits is prime.A093807
Palindromic numbers with property that sum of digits is prime and number of prime digits is prime.
- Palindromic primes with property that sum of digits is prime and number of prime digits is prime.A093808
Palindromic primes with property that sum of digits is prime and number of prime digits is prime.
- a[n] =a[n-1] + 2*n*Prime[n]-n^2.A093809
a[n] =a[n-1] + 2*n*Prime[n]-n^2.
- Smallest prime factor of 2^n-3.A093810
Smallest prime factor of 2^n-3.